The universal computer

Similar documents
The roots of computability theory. September 5, 2016

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

CS187 - Science Gateway Seminar for CS and Math

Computational Thinking

The Search for the Perfect Language

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

Mathematical Logic. Giuseppe Peano ( ) Core Logic 2004/05-1ab p. 2/2

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

4-3. Physics ~ Metaphysics. Meta-physics

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Computation. Some history...

Turing Centenary Lecture

Church s undecidability result

Propositions as Types

Unit 4: Computer as a logic machine

CST Part IB. Computation Theory. Andrew Pitts

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

Gottfried Wilhelm Leibniz (1666)

CS 275 Automata and Formal Language Theory

Mathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy

Hilbert and the concept of axiom

CS 275 Automata and Formal Language Theory

Gödel s Theorem: Limits of logic and computation

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

Chapter 1. Introduction

The Limit of Humanly Knowable Mathematical Truth

Large Numbers, Busy Beavers, Noncomputability and Incompleteness

Lecture Notes for MATH Mathematical Logic 1

Meanings of Symbolism in Advanced Mathematical Thinking

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

Lecture 11: Measuring the Complexity of Proofs

Introduction to Turing Machines

Turing s Approaches to Computability, Mathematical Reasoning and Intelligence

Decidability: Church-Turing Thesis

ENEE 459E/CMSC 498R In-class exercise February 10, 2015

Class 15: Hilbert and Gödel

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Turing Machines. Lecture 8

Contents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008

CS 135. Designing Functional Programs

Chapter 01: Introduction. Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis

Computability Theory. CS215, Lecture 6,

Gödel, Turing, the Undecidability Results and the Nature of Human Mind

Handouts. CS701 Theory of Computation

Cogito ergo sum non machina!

Zermelo-Fraenkel Set Theory

Complexity Theory. Ahto Buldas. Introduction September 10, Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.

The Road from Leibniz to Turing, Part II

ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936

CSCI3390-Lecture 6: An Undecidable Problem

Making Sense of Reasoning and Proof

Towards a Contemporary Ontology

Recap (1) 1. Automata, grammars and other formalisms can be considered as mechanical devices to solve mathematical problems

Lecture 2: What is Proof?

Set Theory History. Martin Bunder. September 2015

Great Ideas in Theoretical Computer Science

Axiomatic set theory. Chapter Why axiomatic set theory?

Geometry and Philosophy

AN INTRODUCTION TO COMPUTABILITY THEORY

Epistemological and Computational Constraints of Simulation Support for OR Questions

Chapter 2: Introduction to Propositional Logic

A BRIEF HISTORY OF COMPUTING

utomated Reasoning 2 What is automated reasoning? In one sense we'll interpret our title narrowly: we are interested in reasoning in logic and mathema

Little Engines of Proof: Lecture 1

Semantic tree method historical perspective and applications

Observations on Category Theory. John L. Bell

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

Philosophies of Mathematics. The Search for Foundations

arxiv:quant-ph/ v2 2 May 2002

What is logic, the topic of this course? There are at least two answers to that question.

Intuitive infinitesimals in the calculus

02 Propositional Logic

About the impossibility to prove P NP or P = NP and the pseudo-randomness in NP

IST 4 Information and Logic

Reclaiming Meaning in Mathematics

Introduction. the reader with this insignificant observation.

Decidable Languages - relationship with other classes.

Logical Closure Properties of Propositional Proof Systems

Obsevations, Truth and Logic

Industrial revolution and reform of mathematics

Fundamentals of Computer Science

5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci

The Logic of Partitions

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

17.1 The Halting Problem

Linear Algebra Fall mathx.kaist.ac.kr/~schoi/teaching.html.

Workshop 1- Building on the Axioms. The First Proofs

Tableau Systems for Logics of Formal Inconsistency

Development of Thought continued. The dispute between rationalism and empiricism concerns the extent to which we

TOOLING UP MATHEMATICS FOR ENGINEERING*

the logic of provability

cse541 LOGIC FOR COMPUTER SCIENCE

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

Introduction to Logic

Intuitionistic Description Logic and Legal Reasoning

Proving Church s Thesis. Nachum Dershowitz w/ Yuri Gurevich

An Algebraic Characterization of the Halting Probability

Prentice Hall Mathematics, Geometry 2009 Correlated to: Connecticut Mathematics Curriculum Framework Companion, 2005 (Grades 9-12 Core and Extended)

Model Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ

Lecture 13: Turing Machine

Transcription:

The universal computer The road from Leibniz to Turing Instructor: Viola Schiaffonati March, 19 th 2018

Thinking, calculating, programming 2 Processing information in an automatic way The birth of computer science (1930s) The birth of computer engineering (1940s) Different research traditions and their roles Thinking and calculating Thinking and reasoning Calculating, programming, and implementing

The construction of knowledge 3

Different research traditions 4 Constant human tendency to represent

Representing external aspects 5 Heron of Alexandria (I century A.D.) Semiautomatic machines (autòmatha) Water-powered and steampowered

Representing internal aspects 6 Raimon Lull (1235-1315) Ars Magna: general principles of human knowledge represented by numbers and symbols composed to obtain further knowledge Ars inveniendi veritatem

Reducing for knowing: Decartes (XVII century) 7 Discourse on method Foundations of knowledge and reduction of any form of knowledge to scientific rigor «To divide each of the difficulties under examination into as many parts as possible, and as might be necessary for its adequate solution» (Decartes, second rule)

Calculating numbers: Pascal (XVII century) 8 First mechanical calculator Prodigy and not instrument

Thought and representation: Hobbes (XVII century) 9 Theory of reasoning as a theory of adequate combinations

Calculating thoughts: Leibniz (XVII century) 10 Project of mechanizing rationality Axiomatic-deductive system Characteristica universalis and calculus ratiocinator

Calculemus! 11 «[...] if controversies were to arise, there would be no more need of disputation between two philosophers than between two calculators. For it would suffice for them to take their pencils in their hands and to sit down at the abacus, and say to each other (and if they so wish also to a friend called to help): Let us calculate.» (Leibniz 1666)

Leibniz s dream 12 An unsolvable problem Adequate representation of knowledge No efficient characteristica universalis No calculus ratiocinator

More engineering: Babbage (XIX century) 13 Difference Engine Automatic calculation of logarithmic tables Analytic machine Memory warehouse Control system

Babbage s ambitions 14 Another unsolvable problem Lack of financial support Analytic machine never built in practice

Leibniz: from dream to reality 15 Boole (1854): algebrization of logic Laws constituting the mathematics of human cognition Frege (1876): formal system (first order logic), notion of proof

Frege s dream 16 Reduction of mathematics to logic (1893)

A broken dream 17 Russell s antinomy (1902) Let R be the set of all sets which are not members of themselves. Then R is neither a member of itself nor not a member of itself

Frege s integrity 18

Another way? 19 David Hilbert (1862-1943) Hilbert program Formal foundations of mathematics in terms of axioms

Entscheidungsproblem! 20 International congress of mathematics (1900) Logical decision problem Problem of finding a general mechanical procedure which, for any formal axiom system and any formula, can decide if the formula can be derived from the axioms in the logical calculus

On Computable Numbers (Turing 1936) 21 How to demonstrate that a procedure able to perform the requested task in an automatic way has not been invented yet and will not be invented in the future? The concept of mechanical process needs to be conceived in a precise and rigorous way The Turing Machine

Turing machine 22 The notion of algorithm receives a satisfactory account only after Turing (1936) has introduced his machine model of a computer This model results from Turing s analysis of the possible processes a human ( the computer ) can go through while performing a calculation using paper and pencil applying rules from a given finite set The human computer follows the rules blindly, without using any insight or ingenuity Negative answer to the decision problem

Two traditions meeting for the first time (1940s) 23 Logical analysis of notions such as formal system and formal proof (and also algorithm and computable function) Incredible progress in the engineering of the electronic components

Computer engineering 24 Z3 (1943), Colossus (1943), Eniac (1945) No program in memory!

Turing in engineers hands 25 Von Neumann in the USA, Newman in UK Manchester baby (1948): first electronic computer with a program in memory

References 26 Davies, M. (2012) The Universal Computer: The Road from Leibniz to Turing, Taylor & Francis Group Frixione, M., Palladino, D. (2004). Funzioni, macchine, algoritmi. Introduzione alla teoria della computabilità. Carocci McCorduck, P. (2004). Machines Who Think: 25th anniversary edition. A. K. Peters.