Random-access Turing machine

<p>In <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity</a>, a field of <a href="/facts/Theoretical_computer_science/jSkGGuvy">theoretical computer science</a>, random-access Turing machines extend the functionality of conventional <a href="/facts/Turing_machine/ojCtglYu">Turing machines</a> by introducing the capability for <a href="/facts/Random_access/1cxrCk3r">random access</a> to <a href="/facts/Computer_memory/hQKVQ51J">memory</a> positions. The inherent ability of RATMs to access any memory cell in a constant amount of time significantly decreases the computation time required for problems where data size and access speed are critical factors. As conventional Turing machines can only access data <a href="/facts/Sequential_access/8NCL847H">sequentially</a>, the capabilities of RATMs are more closely with the memory access patterns of modern computing systems and provide a more realistic framework for analyzing <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> that handle the complexities of large-scale data.
</p>

Random-access Turing machine open-in-new

Random-access Turing machine