vix.ing · top · new · best · stats · spec

G. J. Chaitin

  1. How real are real numbers?
    2004/11/18 by Gregory J. Chaitin, G. J. Chaitin, Chaitin, G. J. · 12 voices
    Computer Science · Mathematics · #Computability, Logic, AI Algorithms #History and Theory of Mathematics #Mathematical and Theoretical Analysis #math.HO #msc:68Q30
  2. From Philosophy to Program Size
    2003/03/27 by Gregory J. Chaitin, G. J. Chaitin, Chaitin, G. J. · 1 voice · 4 citations
    Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Cellular Automata and Applications #Computability, Logic, AI Algorithms #math.HO #msc:68Q30
  3. The Limits of Mathematics---The Book
    1994/07/07 by Gregory J. Chaitin, G. J. Chaitin, Chaitin, G. J. · 1 voice · 1 citation
    Mathematics · Physics and Astronomy · #Advanced Mathematical Theories #Chaotic Dynamics (nlin.CD) #FOS: Physical sciences #nlin.CD
  4. How to Run Algorithmic Information Theory on a Computer
    1995/09/18 by G. J. Chaitin, Gregory J. Chaitin, Chaitin, G. J. · 1 voice
    Computer Science · #Computability, Logic, AI Algorithms #nlin.CD
  5. Epistemology as Information Theory: From Leibniz to Omega
    2005/06/27 by G. J. Chaitin, Gregory J. Chaitin, Chaitin, G. J. · 4 citations
    Arts and Humanities · Computer Science · Mathematics · Neuroscience · #68Q30 #Cognitive Science and Education Research #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #Philosophy and History of Science #math.HO #msc:68Q30
  6. Meta Math! The Quest for Omega
    2004/04/19 by G. J. Chaitin, Gregory J. Chaitin, Chaitin, G. J. · 2 citations
    Computer Science · Mathematics · #68Q30 #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #math.HO #msc:68Q30
  7. On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility
    2002/10/02 by G. J. Chaitin, Gregory J. Chaitin, Chaitin, G. J. · 1 citation
    Computer Science · Mathematics · #68Q30 #Chaos, Complexity, and Education #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #math.HO #msc:68Q30
  8. Irreducible Complexity in Pure Mathematics
    2004/11/04 by G. J. Chaitin, Gregory J. Chaitin, Chaitin, G. J. · 1 citation
    Computer Science · Mathematics · #68Q30 #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #math.HO #msc:68Q30