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 complexity classes, especially for classes using logarithmic time, like DLOGTIME and the Logarithmic Hierarchy.
Definition
On a random-access Turing machine, there is a special pointer tape of logarithmic space accepting a binary vocabulary. The Turing machine has a special state such that when the binary number on the pointer tape is 'p', the Turing machine will write on the working tape the pth symbol of the input.
This lets the Turing machine read any letter of the input without taking time to move over the entire input. This is mandatory for complexity classes using less than linear time.
gollark: I mean, this actually isn't anything like modern NN approaches, despite sort of being "AI".
gollark: AI isn't magic, just magic correlation spotting in giant datasets.
gollark: The computer doesn't know what a "trap" is. It can't really just "avoid" things abstractly.
gollark: I can't just "program trap avoidance", because that leans on a LOT of human intuition about those things.
gollark: I can hardcode specific cases, but no.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.