Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Information theory --- Reasoning --- Mathematics --- -Information theory --- Argumentation --- Ratiocination --- Reason --- Thought and thinking --- Judgment (Logic) --- Logic --- Communication theory --- Communication --- Cybernetics --- Informatics --- Science --- Computer mathematics --- Electronic data processing --- Computer science - Mathematics --- Computer science. --- Informatique --- Mathématiques --- Information, Théorie de l' --- Philosophie --- Automates abstraits

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Machine theory --- Computational Complexity --- LISP (Computer program language) --- Machine theory. --- Computational complexity. --- LISP (Computer program language). --- Computational complexity --- Complexité de calcul (Informatique) --- LISP (Langage de programmation) --- Automates mathématiques, Théorie des --- List processing computer language --- Complexity, Computational --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- List processing (Electronic computers) --- Electronic data processing --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable O number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Gödel and Turing.This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size co

Godel's theorem. --- Incompleteness theorems. --- Logic, Symbolic and mathematical. --- Metamathematics. --- Computational complexity. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Theorems, Incompleteness --- Constructive mathematics --- Proof theory --- Complexity, Computational --- Electronic data processing --- Machine theory --- Logic, Symbolic and mathematical --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Number theory --- Decidability (Mathematical logic) --- Philosophy --- Foundations --- Gödel's theorem.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematics.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computational complexity --- LISP (Computer program language) --- Machine theory