The Search for the Perfect Language

Similar documents
The Limit of Humanly Knowable Mathematical Truth

Computation. Some history...

Set Theory History. Martin Bunder. September 2015

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Understanding Computation

Gödel s Theorem: Limits of logic and computation

Theory of Computation CS3102 Spring 2014

The roots of computability theory. September 5, 2016

Cantor and sets: La diagonale du fou

Zermelo-Fraenkel Set Theory

Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

Sets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7

Gödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel

This section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

CSCI3390-Lecture 6: An Undecidable Problem

The Legacy of Hilbert, Gödel, Gentzen and Turing

The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson

Creative Objectivism, a powerful alternative to Constructivism

CISC 876: Kolmogorov Complexity

Paradox Machines. Christian Skalka The University of Vermont

Church s undecidability result

IST 4 Information and Logic

Huan Long Shanghai Jiao Tong University

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

CS187 - Science Gateway Seminar for CS and Math

Ordinals. Mustafa Elsheikh elsheimm at mcmaster dot ca. Wed 18 Nov 2008

On some Metatheorems about FOL

Lecture 2: What is Proof?

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability

Introduction to Logic and Axiomatic Set Theory

CITS2211 Discrete Structures (2017) Cardinality and Countability

The Reflection Theorem

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M

Set Theory and the Foundation of Mathematics. June 19, 2018

Gödel in class. Achim Feldmeier Brno - Oct 2010

The Axiom of Choice and its Discontents

Logic and Computation

Trees and generic absoluteness

Axiomatic set theory. Chapter Why axiomatic set theory?

MAGIC Set theory. lecture 2

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

The universal computer

MAGIC Set theory. lecture 1

17.1 The Halting Problem

Handbook of Logic and Proof Techniques for Computer Science

Bootstrapping Mathematics

Decidable Languages - relationship with other classes.

Decidability: Church-Turing Thesis

Gödel s Incompleteness Theorems

Philosophy of Religion. Notes on Infinity

MATH 3300 Test 1. Name: Student Id:

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

INTRODUCTION TO CARDINAL NUMBERS

Incompleteness Theorems, Large Cardinals, and Automata ov

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018

Proof Theory and Subsystems of Second-Order Arithmetic

1 The fact that the word algorithm is a close anagram of the Greek derived word logarithm

Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem

On Recognizable Languages of Infinite Pictures

Introduction to Turing Machines

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Open access to the SEP is made possible by a world-wide funding initiative. Please Read How You Can Help Keep the Encyclopedia Free

On Recognizable Languages of Infinite Pictures

We introduce one more operation on sets, perhaps the most important

Gödel s Incompleteness Theorem. Overview. Computability and Logic

Extended Essay - Mathematics

Informal Statement Calculus

Hilbert s problems, Gödel, and the limits of computation

Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid

Notes on induction proofs and recursive definitions

... The Sequel. a.k.a. Gödel's Girdle

Turing Machines. Lecture 8

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM

WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?

Review: Stephen G. Simpson (1999) Subsystems of Second-Order Arithmetic (Springer)

Lecture Notes for MATH Mathematical Logic 1

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

Institute for Applied Information Processing and Communications (IAIK) Secure & Correct Systems. Decidability

CSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality

Classical Propositional Logic

Sec$on Summary. Definition of sets Describing Sets

Computability Theory

Towards a Contemporary Ontology

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Obsevations, Truth and Logic

Cantor s Theorem. Theorem 7 The set of all subsets of N (2 N ) is infinite and not countable.

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

Hilbert s problems, Gödel, and the limits of computation

Philosophy of Set Theory

IST 4 Information and Logic

SOME TRANSFINITE INDUCTION DEDUCTIONS

Poincaré s Thesis CONTENTS. Peter Fekete

König s Lemma and Kleene Tree

02 The Axiomatic Method

CSE 311 Lecture 28: Undecidability of the Halting Problem. Emina Torlak and Kevin Zatloukal

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

Time Magazine (1984)

On the origin of physics from mathematical logic

Transcription:

The Search for the Perfect Language I'll tell you how the search for certainty led to incompleteness, uncomputability & randomness, and the unexpected result of the search for the perfect language.

Bibliography Umberto Eco, The Search for the Perfect Language, in Italian, French, English... Chaitin, Meta Math (USA), Meta Maths (UK), Alla ricerca di omega, Hasard et complexité en mathématiques + Greek + Japanese + Portuguese David Malone, Dangerous Knowledge, BBC TV, 90 minutes, Google video

Umberto Eco, The Search for the Perfect Language Language of creation (Hebrew?) How God summoned things into being by naming them Expresses inner structure of world Kabbalah Ramon Llull 1200 Combine concepts in all possible ways mechanically Wheels Source of all (universal) knowledge!

Leibniz Mechanical reasoning Characteristica universalis Calculus ratiocinator Settle disputes: "Gentlemen, let us compute!" Computer to multiply Binary arithmetic, base-two Christian Huygens: "The calculus is too mechanical!"

Georg Cantor Mathematical theology! Infinite sets, infinite numbers Transfinite ordinals: 0, 1, 2, 3... ω, ω+1... 2ω... ω 2... ω ω... ω ωωωω... Transfinite cardinals: Integers = ℵ 0, reals = ℵ 1, ℵ 2, ℵ 3... ℵ ω... ℵ ωω... ℵ ω ωωωω... Hilbert/Poincaré: Set theory = heaven/disease!

Bertrand Russell Cantor's diagonal argument: Set of all subsets gives next cardinal. Russell's paradox: Is the set of all subsets of the universal set bigger than the universal set?! Problem: Set of all sets that are not members of (in) themselves. Member of itself or not?!

David Hilbert Formalize all math = TOE = Theory of Everything Objective not subjective truth Absolute truth black or white, not gray Formal axiomatic theory for all mathematics: Has proof-checking algorithm. Has algorithm to generate all the theorems in the theory. Meta-mathematics: Study from outside.

Positive Work on Hilbert's Program John von Neumann Zermelo-Fraenkel

John von Neumann Monist ontology (Spinoza!) 0 = {} empty set 1 = {0} = {{}} 2 = {0, 1} = {{}, {{}}} ω = {0, 1, 2, 3,...} Everything is a set! Including ordered pairs, sequences & functions. All math built from empty set.

Abraham Fraenkel (Hebrew University) Zermelo-Fraenkel set theory = Abstract, formal set theory First-order logic Axiom of choice Avoids sets that are too big.

Negative Work on Hilbert's Program Gödel, 1931 Turing, 1936 Algorithmic Information Theory (AIT), 1960s present

Kurt Gödel, 1931 "This statement is false!" True or false? "This statement is unprovable!" Provable or unprovable? No TOE for mathematics! Incompleteness!

Alan Turing, 1936 Universal Turing machine = Universal programming language The Halting Problem! Uncomputability Incompleteness

Algorithmic Information Theory Program-Size Complexity = minimum size program, minimum number of yes/no decisions God has to make to create something. U(π C p) = C(p) Simulation! Given program p for computer C, concatenate prefix π C to p. Universal machine U simulates the computation C performs given p. Most concise, expressive universal Turing machine, universal programming language. The Halting Probability Ω. Randomness = Irreducible complexity Incompleteness!

Negative Conclusions Hilbert's search for the perfect language giving all math knowledge (= formal axiomatic theory for all of mathematics) cannot succeed! Every formal axiomatic theory is incomplete, as shown by Gödel, Turing, Ω. Search for certainty Incompleteness, uncomputability & randomness. Nevertheless, mathematicians remain enamored with formal proof: See AMS Notices special issue on formal proof, December 2008.

Positive Conclusions However, perfect languages have emerged for computing, not for reasoning. Universal Turing machines and universal programming languages can all simulate each other. Most expressive, concise languages: U(π C p) = C(p). AIT's program-size complexity is a measure of conceptual complexity, of complexity of ideas. Furthermore, viewed from the perspective of the Middle Ages, programming languages give us the God-like power to breathe life into (some) inanimate matter: Hardware Body, Software Soul!