Computation by assembly

DOI10.1016/S0022-0000(75)80054-7zbMath0325.68022MaRDI QIDQ1225457

Robert M. Baer

Publication date: 1975

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) General biology and biomathematics (92B05) Turing machines and related notions (03D10)

Related Items (1)

The halting problem for linear Turing assemblers

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The halting problem for linear Turing assemblers
• Self-assembly and differentiation as models of computability
• Computability by Normal Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation by assembly