Skip to search formSkip to main contentSkip to account menu

Random-access Turing machine

In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Computational complexity theoryComputer scienceDLOGTIMELH (complexity)

Search for papers about Random-access Turing machine

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)