Counter machines

DOI10.1016/S0020-0190(99)00116-7zbMath0999.68066OpenAlexW2914652008MaRDI QIDQ1606993

Arkadiusz Wojna

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00116-7

zbMATH Keywords

Turing machinecomputational power of counters

Mathematics Subject Classification ID

Related Items (1)

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Small universal register machines
• Translatability of schemas over restricted interpretations
• Varianten von Turingmaschinen
• Some open questions in the theory of program schemes and dynamic logics
• Turing machines with restricted memory access
• Counter machines and counter languages
• Computability of Recursive Functions
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: Counter machines