The halting problem for linear Turing assemblers

DOI10.1016/S0022-0000(76)80023-2MaRDI QIDQ1231906zbMATH OpenOpenAlexFDO

Authors Robert M. Baer, J. Van Leeuwen

Publication date 1976

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(76)80023-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10)

Cites work

• scientific article; zbMATH DE number 3305064 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3319549 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A generalization of context-free determinism
• A remark on finite transducers
• Bounded-crossing transducers
• Computation by assembly
• One-tape, off-line Turing machine computations
• Real time computation

Cited in

(2)

• Computation by assembly
• Self-assembly and differentiation as models of computability

This page was built for publication: The halting problem for linear Turing assemblers

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