Rudimentary interpretation of two-tape turing computation

DOI10.1007/BF01070498zbMATH Open0245.02034OpenAlexW2019316542MaRDI QIDQ5656749FDOQ5656749

V. A. Nepomnyashchij

Publication date: 1970

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01070498

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10) Computability and recursion theory (03D99)

Cited In (2)

• Super-exponentials nonprimitive recursive, but rudimentary
• The role of rudimentary relations in complexity theory

This page was built for publication: Rudimentary interpretation of two-tape turing computation

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