Computational processes and incompleteness

MaRDI QIDQ5145164zbMATH OpenFDO

Authors K. Sutner

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3228, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CSP08.22

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Computational processes, observers and Turing incompleteness
• Machines, Computations, and Universality
• A Note on Interaction and Incompleteness
• Metamathematical limits to computation
• scientific article; zbMATH DE number 2182417

Cited in

(6)

• Unpredictability and computational irreducibility
• Computation as an unbounded process
• A Note on Interaction and Incompleteness
• Computational processes, observers and Turing incompleteness
• Computational irreducibility and computational analogy
• Partial evaluation of computation process, revisited.

This page was built for publication: Computational processes and incompleteness

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