Unconventional “Stateless” Turing–Like Machines

DOI10.1007/978-3-540-73554-0_7zbMATH Open1175.68156OpenAlexW2155465120MaRDI QIDQ3603403FDOQ3603403

Authors: Joshua J. Arulanandham 

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73554-0_7

Recommendations

• On stateless multicounter machines
• On quasi-unilateral universal Turing machines
• scientific article; zbMATH DE number 7339588
• Unbounded hardware is equivalent to deterministic Turing machines
• Ultrafilter and Non-standard Turing Machines
• State-transition machines, revisited
• scientific article; zbMATH DE number 3903969
• scientific article; zbMATH DE number 497572
• Turing Unbound: Transfinite Computation
• Universal field machine that computes beyond the Turing limit

Mathematics Subject Classification ID

Cited In (2)

• A universal machine without change of state
• \(n\)-skip Turing machines

This page was built for publication: Unconventional “Stateless” Turing–Like Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603403)