Computation by assembly
From MaRDI portal
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
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)