Talk:Random-access Turing machine

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This is the talk page for discussing improvements to the Random-access Turing machine article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

incomplete description

The article says "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 seems incomplete. The referenced article allows many more operations, like jumping the head and reading from a random position. I think just writing to a random position doesn't allow much more efficient implementations than with traditional Turing machines. FrankBuss (talk) 20:05, 11 May 2025 (UTC)[reply]