Conditional branching is not necessary for universal computation in von Neumann computers

MaRDI QIDQ4942051zbMATH OpenFDO

Authors Raúl Rojas

Publication date 19 March 2000

zbMATH Keywords

models of computationself-modifying machines

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1542874
• On machines, universal by extensions
• Bit copying: the ultimate computational simplicity
• Modeling non-branching programs with conditional stopping on a universal Turing machine
• Small universal register machines

Cited in

(1)

• scientific article; zbMATH DE number 1542874 (Why is no real title available?)

This page was built for publication: Conditional branching is not necessary for universal computation in von Neumann computers

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