Computation by assembly

DOI10.1016/S0022-0000(75)80054-7MaRDI QIDQ1225457zbMATH OpenFDO

Authors Robert M. Baer

Publication date 1975

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3261619 (Why is no real title available?)
• scientific article; zbMATH DE number 3273197 (Why is no real title available?)
• scientific article; zbMATH DE number 3315195 (Why is no real title available?)
• scientific article; zbMATH DE number 3316944 (Why is no real title available?)
• scientific article; zbMATH DE number 3382227 (Why is no real title available?)
• Computability by Normal Algorithms
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Self-assembly and differentiation as models of computability
• The halting problem for linear Turing assemblers

Cited in

(1)

• The halting problem for linear Turing assemblers

This page was built for publication: Computation by assembly

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