Introduction: computability of the physical

DOI10.1017/S0960129511000491zbMath1248.03008OpenAlexW2129661432WikidataQ57001500 ScholiaQ57001500MaRDI QIDQ2919936

S. Barry Cooper, Cristian S. Calude

Publication date: 23 October 2012

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129511000491

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Unnamed Item
• Natural halting probabilities, partial randomness, and zeta functions
• Conservative logic
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• Most programs stop quickly or never halt
• On partial randomness
• Fixed Point Theorems on Partial Randomness
• A Course in Mathematical Logic for Mathematicians
• A Theory of Program Size Formally Identical to Information Theory
• Information distance
• A formal theory of inductive inference. Part I

This page was built for publication: Introduction: computability of the physical