The machine as data: a computational view of emergence and definability

DOI10.1007/s11229-015-0803-4zbMathNonearXiv1506.06270OpenAlexW753604061WikidataQ59896828 ScholiaQ59896828MaRDI QIDQ514566

S. Barry Cooper

Publication date: 9 March 2017

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.06270

zbMATH Keywords

universalityemergenceembodimenthigher order computationincomputabilityTuring definability

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10) General topics in the theory of computing (68Q01) Higher-type and set recursion theory (03D65)

Related Items (2)

IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ The ontology of digital physics

Cites Work

• A logic road from special relativity to general relativity
• Semantic information and the correctness theory of truth
• Is The theory of everything merely the ultimate ensemble theory?
• Relativistic computers and the Turing barrier
• A Turing test for free will
• Higher-Order Computability
• The Singular Universe and the Reality of Time
• Systems of Logic Based on Ordinals^†
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The machine as data: a computational view of emergence and definability