Randomness and Complexity, From Leibniz to Chaitin

2007/10/01 by Cristian S. Calude · 3 citations
Computer Science · #Computability, Logic, AI Algorithms

paper · doi:10.1142/6577

openalex publication_date 2007/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/05

Abstract

The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin s 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays.

Cited by

• Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability
• Physically-relativized Church–Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics
• Cristian Calude [wikipedia]

Related

• A Century of Controvery Over the Foundations of Mathematics II
• Leibniz, Randomness and the Halting Probability
• Straddling between determinism and randomness: Chaos theory vis-a-vis Leibniz
• Randomness
• Irreducible Complexity in Pure Mathematics