Proving Church s Thesis. Nachum Dershowitz w/ Yuri Gurevich
|
|
- Mitchell Paul
- 5 years ago
- Views:
Transcription
1 Proving Church s Thesis Nachum Dershowitz w/ Yuri Gurevich
2
3
4 What is the thesis?
5 Church s Thesis (1936) Recursive functions capture effective computability
6 Recursive Functions Partial functions on natural numbers Initial functions: 0 and successor Other functions defined via equations: x + 0 = x x + y = (x + y) 0 y = 0 x y = (x y) [Hilbert, Ackermann, Peter, Herbrand, Gödel]
7 Recursive Functions Partial functions on natural numbers Initial functions: 0 and successor Other functions defined via equations: x + 0 = x x + y = (x + y) 0 y = 0 x y = (x y) f(n) = { 1 n=0 n f(n-1) otherwise [Hilbert, Ackermann, Peter, Herbrand, Gödel]
8 Alonzo Church (1936) [We] propose a definition of effective calculability which is thought to correspond satisfactorily to [a] somewhat vague intuitive notion... We now define... the notion of effective calculable function of the positive integers by identifying it with the notion of a recursive function.
9 Emil Leon Post (1936) To mask this identification under a definition hides the fact that a fundamental discovery in the limitations of mathematicizing power of Homo Sapiens has been made and blinds us to the need of its continual verification.
10 Alan Turing (1936) A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine
11 Turing s Thesis Turing Machines capture mechanical human computation
12 Church [Turing's machines have] the advantage of making the identification with effectiveness in the ordinary (not explicitly defined) sense evident immediately. To define effectiveness as computability by an arbitrary machine, subject to restrictions of finiteness, would seem an adequate representation of the ordinary notion.
13 Steve Kleene (1936) So Turing s and Church s theses are equivalent. We shall usually refer to them both as Church s thesis, or in connection with that one of its... versions which deals with Turing machines as the Church- Turing thesis.
14 Thesis I Every partial function which is effectively calculable (in the sense that there is an algorithm by which its value can be calculated for every n -tuple belonging to its range of definition) is potentially partial recursive.
15 Church-Turing Thesis - All effective computational models are equivalent to, or weaker than, Turing machines
16 Robin Gandy The confluence of ideas in 1936
17 Why make the claim?
18 Why? The thesis allowed Church and Turing to prove undecidability of a classical decision problem
19 Ramon Lull (1274) Raymondus Lullus Ars Magna et Ultima
20
21 Gottfried Wilhelm Leibniz (1666) The only way to rectify our reasonings is to make them as tangible as those of the Mathematician, so that we can find our error at a glance, and when there are disputes among persons, we can simply say: Let us calculate [calculemas], without further ado, in order to see who is right.
22
23 David Hilbert s Entscheidungsproblem #2. Provide an effective method to determine if a formula is valid. (c. 1900)
24 Satisfiability Problem Given an arbitrary formula in first-order predicate calculus, decide if it is satisfiable (invalid) or unsatisfiable (valid). Satisfiable: True for some interpretation Valid: True in all interpretations
25 Hilbert & Ackermann (1928) The Entscheidungsproblem is solved when we know a procedure that allows for any given logical expression to decide by finitely many operations its validity or satisfiability.
26 Hilbert & Ackermann The Entscheidungsproblem must be considered the main problem of mathematical logic. [Its solution] is of fundamental significance for the theory of all domains whose propositions could be developed on the basis of a finite number of axioms.
27 Jules Henri Poincaré We might imagine a machine where we should put in axioms at one end and take out theorems at the other, like that legendary machine in Chicago where pigs go in alive and come out transformed into hams and sausages.
28 Kurt Gödel If the human mind were equivalent to a finite machine, then... there would exist absolutely unsolvable problems, where the epithet absolutely means that they would be undecidable, not just within some particular axiomatic system, but by any mathematical proof the mind can conceive.
29 Why prove the claim?
30 Richard Shore (2001) First in Shore s list of pie in the sky problems for the 21st century.
31 Richard Montague (1960) Discussion of Church s thesis has suffered for lack of a precise general framework within which it could be conducted
32 Reactions 1. I know it is true. 2. I know it is false. 3. I know it is unprovable.
33 Preaching to the Choir
34 Turing (1948) Logical Computing Machines can do anything that could be described as rule of thumb or purely mechanical. This is sufficiently well established that it is now agreed amongst logicians that calculable by means of an LCM is the correct rendering of such phrases.
35 Humans are not Machines
36 Bringsjord Lucas Penrose
37 It Can t be Done
38 Laszlo Kalmár (1959) There are premathematical concepts which must remain [so]... Among these belong... such concepts as that of effective calculability... the extension of which cannot cease to change during the development of mathematics. 38
39 Why believe the claim?
40 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov
41 Church ( ) Lambda Calculus λx. (x x)
42 Church The fact that two such widely different equally natural definitions of effective calculability turn out to be equivalent adds to the strength of the reasons for believing that they constitute as general a characterization of this notion as is consistent with the usual intuitive understanding of it.
43 Bernard Moret The remarkable result about these varied models is that all of them define exactly the same class of computable functions: whatever one model can compute, all the others can too!
44 Princeton Course The definition of a Turing machine is very complete. Multiple heads Multiple tapes Multiple states Multiple directions Multiple dimensions Multiple worlds
45 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov What excludes a systematic error? People thought primitive recursive was it
46 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov What excludes a systematic error? People thought primitive recursive was it Experience: programming languages compute only recursive functions
47 The Turing Tarpit Thue systems Post systems Lambda calculi Partial recursion Turing machines Markov normal algorithms Minsky counter machines Type 0 languages Kolmogorov-Uspenskii machines Neuring machines Wang machines Random access machines Quantum computers Billiard ball computers Least fixpoints Fortran, Algol, Lisp, C, Pascal, Logo, Ada, Java,...
48
49 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov What excludes a systematic error? People thought primitive recursive was it Experience: programming languages compute only recursive functions History is full of delayed discoveries
50 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov What excludes a systematic error? People thought primitive recursive was it Experience: programming languages compute only recursive functions History is full of delayed discoveries Turing s analysis This is by far the strongest argument
51 Gödel It was only by Turing s work that it became completely clear, that my proof is applicable to every formal system containing arithmetic.
52 Why Believe? Model equivalence: Church, Turing, Post, Markov, Kolmogorov What excludes a systematic error? People thought primitive recursive was it Experience: programming languages compute only recursive functions History is full of delayed discoveries Turing s analysis This is by far the strongest argument Does not cover all algorithms
53 How can one prove the claim?
54 Turing s Premises Sequential symbol manipulation Deterministic Finite internal states Finite symbol space Finite observability and local action Linear external memory
55 Church to Kleene (1935) [Gödel thought] that it might be possible... to state a set of axioms which would embody the generally accepted properties of [effective calculability], and to do something on that basis.
56 Joe Shoenfield (1991) It may seem that it is impossible to give a proof of Church s Thesis. However, this is not necessarily the case. We can write down some axioms about computable functions which most people would agree are evidently true. It might be possible to prove Church s Thesis from such axioms.
57 Joe Shoenfield However, despite strenuous efforts, no one has succeeded in doing this (although some interesting partial results have been obtained).
58 Formalization of Effective Algorithm
59 Euclid (c. -300) Euclid s GCD algorithm appeared in his Elements. Formulated geometrically: Find common measure for 2 lines. Used repeated subtraction of the shorter segment from the longer.
60 Don Knuth (1966) Algorithms are concepts which have existence apart from any programming language I believe algorithms were present long before Turing et al. formulated them, just as the concept of the number two was in existence long before the writers of first grade textbooks and other mathematical logicians gave it a certain precise definition.
61 Postulates I. An algorithm determines a computational sequence II. Elements of the sequence can be arbitrary structures III. Transitions are governed by some finite description IV. Only computable operations are given initially
62 I
63 What is an algorithm? An algorithm is a kind of state transition system.
64 Knuth (1966) A computational method comprises a set of states In this way we can divorce abstract algorithms from particular programs that represent them.
65 Hartley Rogers, Jr. (1966) Roughly speaking, an algorithm is a clerical (i.e., deterministic, bookkeeping) procedure which can be applied to any of a certain class of symbolic inputs and which will eventually yield, for each such input, a corresponding symbolic output. An example of an algorithm is the usual procedure given in elementary calculus for differentiating polynomials
66 Donald Knuth (1968) A computational method consists of: 1. States Q 2. Input I Q 3. Output O Q 4. Transitions τ : Q Q
67 terminal
68 State Transition >
69 Computation
70 Computation
71 Algorithm = Transition System I Q O
72 I. Sequential Time An algorithm is a state-transition system. Its transitions are partial functions.
73
74 Rogers For any given input, the computation is carried out in a discrete stepwise fashion, without use of continuous methods or analogue devices. Computation is carried forward deterministically, without resort to random methods or devices, e.g., dice. Virtually all mathematicians would agree that, although inexactly stated, [these features] are inherent in the idea of algorithm.
75 Joe Shoenfield A method must be mechanical Methods which involve chance procedures are excluded; methods which involve magic are excluded; methods which require insight are excluded.
76
77
78
79
80 II
81 Church An algorithm consists of a method by which... a sequence of expressions (in some notation)... can be obtained; [each] is effectively calculable [given prior expressions]; and where... the fact that the algorithm has terminated becomes effectively known and the [output] is effectively calculable.
82 Goal Representation-independent axioms Church uses numbers Turing uses string representation Gandy uses finite set representation ASMs use any structure
83 Robin Gandy (1980) States can be described by hereditarily finite sets The rank of these sets is bounded Machines can be assembled unambiguously from individual parts of bounded size Causation is local 83
84 What is a state? A state is any (first-order) structure. All relevant information should be included in the functions and relations of the state.
85 Emil Post (1922) The symbol-complexes are completely determined by specifying all the properties and relations of its parts Each complex of the system can be completely described [by a conjunction of relations]
86 State encapsulates all relevant data!
87 [a] [f] [a] [f]
88
89 C C
90 II. Abstract State States are (first-order) structures. All states share the same (finite) vocabulary. Transitions preserve the domain (base set) of states.
91 C C F C F
92 II. Abstract State States are (first-order) structures. All states share the same (finite) vocabulary. Transitions preserve the domain (base set) of states. States (and initial and terminal states) are closed under isomorphism. Transitions commute with isomorphisms.
93 Abstract-State Postulate Data is arranged in a structure of a finite signature. c f g An algorithm is abstract, thus applicable to all isomorphic structures. x= 101 ; s(x)= 110 ; τ x= 110 ; s(x)= 111 ; x=5; s(x)=6; τ x=6; s(x)=7;
94
95 Infinitary Operations min(a1,a2,..) X min{ai }
96 III
97 What is a transition? Transitions are algorithmic if they can all be described finitely (without presupposing any special knowledge).
98 Kleene An algorithm in our sense must be fully and finitely described before any particular question to which it is applied is selected... All steps must... be predetermined and performable without any exercise of ingenuity or mathematical invention by the person doing the computing.
99 Andrei Kolmogorov (1953) The computational operations are carried out in discrete steps, where every step only uses a bounded part of the results of all preceding operations. The unboundedness of memory is only quantitative: i.e., we allow an unbounded number of elements to be accumulated, but they are drawn from a finite set of types, and the relations that connect them have limited complexity
100 III. Bounded Exploration Yuri Gurevich Transitions are determined by a fixed finite set of terms, such that states that agree on the values of these terms, also agree on all state changes.
101
102 C
103 Bounded Exploration Whenever X,Y coincide on T, τ (x)-x = τ (y)-y T = {x, f(x)} x=3; f(3)=5; y=7 τ x=1; f(3)=0; y=7 x=3; f(3)=5; y=2 τ x=1; f(3)=0; y=2 x=3; f(3)=5; y=1 τ x=1; f(3)=0; y=4
104 IV
105 What is effective? Basic arithmetic certainly is. The halting function might not be.
106 Martin Davis If non-computable inputs are permitted, then non-computable outputs are attainable.
107 Federico Luigi Menabrea (1842) We must limit ourselves to admitting that the first four operations of arithmetic, that is addition, subtraction, multiplication and division, can be performed in a direct manner through the intervention of the machine. The machine is thence capable of performing every species of numerical calculation, for all such calculations ultimately resolve themselves into the four operations we have just named.
108 IV. Initial State Static part of initial states is arithmetic: natural numbers and operations +,-,,,=,<. Inputs initialized to natural numbers. Rest is undefined.
109 No Magic
110 Church-Turing Theorem Any numeric (string) function computed by a transition system that satisfies the postulates is partial recursive (Turing computable).
111 ASM Theorem Abstract state machines emulate algorithmic computations (Postulates I-III)
112 Abstract State Machine f(s 1,...,s n ) := t if c 1... c n then P [P 1... P k ]
113 Proof States can be divided into equivalence classes based on equalities between glossary of critical terms Changes can be captured by assignments using only critical terms.
114 Procedures A procedure is a sequential algorithm, in which the initial states of all runs are the same, except for some constant In
115 The initial state may contain uncomputable oracles But...
116 ASMT CT If an ASM s initial state has only basic arithmetic (N;0,1,+,x,=,<), then it computes a partial recursive function. A numerical function is effective iff it is (partial) recursive.
117 My favorite computer
118 ? -? +! - + +
119 Theorem The following are equivalent: f : N N is recursive. An arithmetical algorithm computes f. An arithmetical ASM computes f.
120 But there is more to algorithms than numbers!
121 Rich Domain
122 What about other domains? What should be considered effective for non-numeric or non-string domains?
123 Ada Lovelace Many persons... imagine that because [the Analytical Engine] give[s] its results in numerical notation, the nature of its processes must... be arithmetical and numerical rather than algebraical and analytical. This is an error.
124 Ada Lovelace The engine can arrange and combine its numerical quantities exactly as if they were letters or any other general symbols. 124
125 Graph Domain
126 What else is effective? Consider f (n ) = min i. p (g n+i (c)) where p,g,c work over graphs, say.
127 IV: Initial State Initial states do not contain ineffective operations.
128 Track Functions
129
130 IV*: Initial State The domain of an algorithm is arithmetizable. Meaning: There s a numerical encoding (not a priori effective) of the additional domain s.t. the induced initial functions are recursive.
131 Recursive State
132 Decidable Equality [W. Reisig]
133 Constructors (w/ U. Boker)
134 Examples A = { N; 0, S } 0 S(0) S(S(0)) B = { binary trees; nil, cons } nil cons(nil,nil) cons(nil,cons(nil,nil)) cons(cons(nil,nil),cons(nil,nil))
135 IV*: Effectiveness Every operation is tracked by a recursive function. Equivalence of terms is decidable. Every operation is computable from the free term (Herbrand) algebra. (can be extended to partial operations)
136 Theorem Turing Machines simulate (up to isomorphism) all effective models (under some representation). And under no representation can an effective model do more.
137 Equivalence of Models TM 2 < TM [ 1 tape; 2 channels ] CM 2 < TM 2 [ BBB... ] CM n < CM 2 [ 2 i 3 j 5 k 7 l... ] RAM < CM n [ 2 x (2y+1) ] Scheme < RAM [ Abelson & Sussman ] TM < Scheme [ Interpreter ]
138 What if I don t believe the claim?
139 Bringsjord Lucas Penrose
140
141
142
143 Martin Davis How can we ever exclude the possibility of our presented, some day (perhaps by some extraterrestrial visitors), with a (perhaps extremely complex) device or oracle" that computes" an uncomputable function?"
144 Violate Axioms I. Transfinite or continuous sequence of states II. Infinitary operations III. Unbounded program or table lookup IV. Super primitive operations
145 Murray Eden (MIT) God need not clutter his memory with infinite lists when the same information can be stored algorithmically within a finite memory. There may be in God s memory algorithms for finding algorithms, algorithms for algorithms for finding algorithms, and so on. Each embedment may decrease Her need for storage capacity but not at all decrease knowledge.
Gottfried Wilhelm Leibniz (1666)
Euclid (c. -300) Euclid s GCD algorithm appeared in his Elements. Formulated geometrically: Find common measure for 2 lines. Used repeated subtraction of the shorter segment from the longer. Gottfried
More informationEffective Abstract State Machines
Effective Abstract State Machines Nachum Dershowitz w/ Udi Boker & Yuri Gurevich February 2007 Church-Turing Thesis - All effective computational models are equivalent to, or weaker than, Turing machines.
More informationAlan Turing (1936) A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine
Analog Models Alan Turing (1936) A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine Turing s Machines Turing [1948] The property of being
More informationIntroduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
More informationThe roots of computability theory. September 5, 2016
The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.
More informationCS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018
CS 301 Lecture 17 Church Turing thesis Stephen Checkoway March 19, 2018 1 / 17 An abridged modern history of formalizing algorithms An algorithm is a finite, unambiguous sequence of steps for solving a
More informationTHE CONSTRUCTIVE SECOND NUMBER CLASS*
224 ALONZO CHURCH [April THE CONSTRUCTIVE SECOND NUMBER CLASS* ALONZO CHURCH The existence of at least a vague distinction between what I shall call the constructive and the non-constructive ordinals of
More informationCogito ergo sum non machina!
Cogito ergo sum non machina! About Gödel s First Incompleteness Theorem and Turing machines. Ricardo Pereira Tassinari 1 Philosophy Department of State University of São Paulo - UNESP - Campus Marília
More informationComputability Theory. CS215, Lecture 6,
Computability Theory CS215, Lecture 6, 2000 1 The Birth of Turing Machines At the end of the 19th century, Gottlob Frege conjectured that mathematics could be built from fundamental logic In 1900 David
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationThe Church-Turing Thesis and Relative Recursion
The Church-Turing Thesis and Relative Recursion Yiannis N. Moschovakis UCLA and University of Athens Amsterdam, September 7, 2012 The Church -Turing Thesis (1936) in a contemporary version: CT : For every
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationCS187 - Science Gateway Seminar for CS and Math
CS187 - Science Gateway Seminar for CS and Math Fall 2013 Class 3 Sep. 10, 2013 What is (not) Computer Science? Network and system administration? Playing video games? Learning to use software packages?
More informationCS 275 Automata and Formal Language Theory
CS 275 Automata and Formal Language Theory Course Notes Part III: Limits of Computation Chapter III.1: Introduction Anton Setzer http://www.cs.swan.ac.uk/ csetzer/lectures/ automataformallanguage/current/index.html
More informationFundamentals of Computer Science
Fundamentals of Computer Science Chapter 8: Turing machines Henrik Björklund Umeå University February 17, 2014 The power of automata Finite automata have only finite memory. They recognize the regular
More informationLarge Numbers, Busy Beavers, Noncomputability and Incompleteness
Large Numbers, Busy Beavers, Noncomputability and Incompleteness Food For Thought November 1, 2007 Sam Buss Department of Mathematics U.C. San Diego PART I Large Numbers, Busy Beavers, and Undecidability
More informationCOMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lec. 16 : Turing Machines
COMP-330 Theory of Computation Fall 2017 -- Prof. Claude Crépeau Lec. 16 : Turing Machines COMP 330 Fall 2017: Lectures Schedule 1-2. Introduction 1.5. Some basic mathematics 2-3. Deterministic finite
More information258 Handbook of Discrete and Combinatorial Mathematics
258 Handbook of Discrete and Combinatorial Mathematics 16.3 COMPUTABILITY Most of the material presented here is presented in far more detail in the texts of Rogers [R], Odifreddi [O], and Soare [S]. In
More informationAutomata Theory. Definition. Computational Complexity Theory. Computability Theory
Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential
More information7.1 The Origin of Computer Science
CS125 Lecture 7 Fall 2016 7.1 The Origin of Computer Science Alan Mathison Turing (1912 1954) turing.jpg 170!201 pixels On Computable Numbers, with an Application to the Entscheidungsproblem 1936 1936:
More informationCS 275 Automata and Formal Language Theory
CS 275 Automata and Formal Language Theory Course Notes Part III: Limits of Computation Chapt. III.1: Introduction Anton Setzer http://www.cs.swan.ac.uk/ csetzer/lectures/ automataformallanguage/current/index.html
More informationRecap (1) 1. Automata, grammars and other formalisms can be considered as mechanical devices to solve mathematical problems
Computability 1 Recap (1) 1. Automata, grammars and other formalisms can be considered as mechanical devices to solve mathematical problems Mathematical problems are often the formalization of some practical
More informationPropositions as Types
Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......
More informationCOMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lec. 14 : Turing Machines
COMP-330 Theory of Computation Fall 2012 -- Prof. Claude Crépeau Lec. 14 : Turing Machines 1 COMP 330 Fall 2012: Lectures Schedule 1. Introduction 1.5. Some basic mathematics 2. Deterministic finite automata
More informationTuring Centenary Lecture
Turing Centenary Lecture P.D.Welch University of Bristol Visiting Research Fellow, Isaac Newton Institute Early Life King s College 1931 King s College 1931 Hardy Eddington He attended Eddington s lectures
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) October,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (D-ITET) October, 19 2017 Part 5 out of 5 Last week was all about Context-Free Languages Context-Free
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
More informationDecidability: Church-Turing Thesis
Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there
More informationHalting and Equivalence of Program Schemes in Models of Arbitrary Theories
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories Dexter Kozen Cornell University, Ithaca, New York 14853-7501, USA, kozen@cs.cornell.edu, http://www.cs.cornell.edu/~kozen In Honor
More informationComputability Theory
Computability Theory Cristian S. Calude May 2012 Computability Theory 1 / 1 Bibliography M. Sipser. Introduction to the Theory of Computation, PWS 1997. (textbook) Computability Theory 2 / 1 Supplementary
More informationOn Semantics-to-Syntax Analyses of Algorithms
On Semantics-to-Syntax Analyses of Algorithms Yuri Gurevich Microsoft Research Redmond, WA, USA gurevich@microsoft.com Give me a fulcrum, and I will move the world. Archimedes Abstract: Alan Turing pioneered
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationOpleiding Informatica
Opleiding Informatica Tape-quantifying Turing machines in the arithmetical hierarchy Simon Heijungs Supervisors: H.J. Hoogeboom & R. van Vliet BACHELOR THESIS Leiden Institute of Advanced Computer Science
More informationUnderstanding Computation
Understanding Computation 1 Mathematics & Computation -Mathematics has been around for a long time as a method of computing. -Efforts to find canonical way of computations. - Machines have helped with
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationAN INTRODUCTION TO COMPUTABILITY THEORY
AN INTRODUCTION TO COMPUTABILITY THEORY CINDY CHUNG Abstract. This paper will give an introduction to the fundamentals of computability theory. Based on Robert Soare s textbook, The Art of Turing Computability:
More informationChapter 2 Algorithms and Computation
Chapter 2 Algorithms and Computation In this chapter, we first discuss the principles of algorithm and computation in general framework, common both in classical and quantum computers, then we go to the
More informationMost General computer?
Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall
More informationENEE 459E/CMSC 498R In-class exercise February 10, 2015
ENEE 459E/CMSC 498R In-class exercise February 10, 2015 In this in-class exercise, we will explore what it means for a problem to be intractable (i.e. it cannot be solved by an efficient algorithm). There
More informationTheory of Computation (IX) Yijia Chen Fudan University
Theory of Computation (IX) Yijia Chen Fudan University Review The Definition of Algorithm Polynomials and their roots A polynomial is a sum of terms, where each term is a product of certain variables and
More informationChurch s undecidability result
Church s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Welcome, and thank you for the invitation to speak about Church s lambda calculus
More informationCST Part IB. Computation Theory. Andrew Pitts
Computation Theory, L 1 1/171 CST Part IB Computation Theory Andrew Pitts Corrections to the notes and extra material available from the course web page: www.cl.cam.ac.uk/teaching/0910/comptheory/ Introduction
More informationCSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits
CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits Chris Calabro January 13, 2016 1 RAM model There are many possible, roughly equivalent RAM models. Below we will define one in the fashion
More information(a) Definition of TMs. First Problem of URMs
Sec. 4: Turing Machines First Problem of URMs (a) Definition of the Turing Machine. (b) URM computable functions are Turing computable. (c) Undecidability of the Turing Halting Problem That incrementing
More informationGödel s Theorem: Limits of logic and computation
Gödel s Theorem: Limits of logic and computation David Keil (dkeil@frc.mass.edu) Framingham State College Math/CS Faculty Seminar March 27, 2003 1 Overview Kurt Gödel, 1931, at age 25, in Vienna, shook
More informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages Context-Free Languages Regular Languages
More informationTuring Machines (TM) The Turing machine is the ultimate model of computation.
TURING MACHINES Turing Machines (TM) The Turing machine is the ultimate model of computation. Alan Turing (92 954), British mathematician/engineer and one of the most influential scientists of the last
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationThe Turing Machine. Computability. The Church-Turing Thesis (1936) Theory Hall of Fame. Theory Hall of Fame. Undecidability
The Turing Machine Computability Motivating idea Build a theoretical a human computer Likened to a human with a paper and pencil that can solve problems in an algorithmic way The theoretical provides a
More informationTuring Machines and the Church-Turing Thesis
CSE2001, Fall 2006 1 Turing Machines and the Church-Turing Thesis Today our goal is to show that Turing Machines are powerful enough to model digital computers, and to see discuss some evidence for the
More informationLecture notes on Turing machines
Lecture notes on Turing machines Ivano Ciardelli 1 Introduction Turing machines, introduced by Alan Turing in 1936, are one of the earliest and perhaps the best known model of computation. The importance
More informationTuring Machines Decidability
Turing Machines Decidability Master Informatique 2016 Some General Knowledge Alan Mathison Turing UK, 1912 1954 Mathematician, computer scientist, cryptanalyst Most famous works: Computation model («Turing
More informationUndecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines
More informationLecture 1: The arithmetic hierarchy
MODEL THEORY OF ARITHMETIC Lecture 1: The arithmetic hierarchy Tin Lok Wong 8 October, 2014 [These theorems] go a long way to explaining why recursion theory is relevant to the study of models of arithmetic.
More informationComputational Models Lecture 7, Spring 2009
Computational Models Lecture 7, Spring 2009 The Church-Turing Thesis The language classes R = RE core David Hilbert s Tenth Problem Encoding of TMs Universal Turing Machines The Halting/Acceptance problem
More informationTuring Machines. Lecture 8
Turing Machines Lecture 8 1 Course Trajectory We will see algorithms, what can be done. But what cannot be done? 2 Computation Problem: To compute a function F that maps each input (a string) to an output
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationLecture 19: Universality and Computability
Fundamental Questions Lecture 19: Universality and Computability Universality What is a general purpose computer? Computability Are there problems that no machine can solve? Church-Turing thesis Are there
More informationThe Church-Turing Thesis
The Church-Turing Thesis Huan Long Shanghai Jiao Tong University Acknowledgements Part of the slides comes from a similar course in Fudan University given by Prof. Yijia Chen. http://basics.sjtu.edu.cn/
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationGreat Theoretical Ideas
15-251 Great Theoretical Ideas in Computer Science Gödel s Legacy: Proofs and Their Limitations Lecture 25 (November 16, 2010) The Halting Problem A Quick Recap of the Previous Lecture Is there a program
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationUndecidable Problems. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, / 65
Undecidable Problems Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, 2018 1/ 65 Algorithmically Solvable Problems Let us assume we have a problem P. If there is an algorithm solving
More informationCreative Objectivism, a powerful alternative to Constructivism
Creative Objectivism, a powerful alternative to Constructivism Copyright c 2002 Paul P. Budnik Jr. Mountain Math Software All rights reserved Abstract It is problematic to allow reasoning about infinite
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationLimits of Computation
The real danger is not that computers will begin to think like men, but that men will begin to think like computers Limits of Computation - Sydney J. Harris What makes you believe now that I am just talking
More informationComputation. Some history...
Computation Motivating questions: What does computation mean? What are the similarities and differences between computation in computers and in natural systems? What are the limits of computation? Are
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationGödel s Incompleteness Theorem. Overview. Computability and Logic
Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,
More informationFrom Constructibility and Absoluteness to Computability and Domain Independence
From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Nachum Dershowitz & Yishay Mansour. Tel Aviv University. May 17 22, 2017 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationThe Turing machine model of computation
The Turing machine model of computation For most of the remainder of the course we will study the Turing machine model of computation, named after Alan Turing (1912 1954) who proposed the model in 1936.
More informationDecidable Languages - relationship with other classes.
CSE2001, Fall 2006 1 Last time we saw some examples of decidable languages (or, solvable problems). Today we will start by looking at the relationship between the decidable languages, and the regular and
More informationComplexity Theory. Ahto Buldas. Introduction September 10, Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.
Introduction September 10, 2009 Complexity Theory Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas e-mail: Ahto.Buldas@ut.ee home: http://home.cyber.ee/ahtbu phone:
More informationIV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University
IV. Turing Machine Yuxi Fu BASICS, Shanghai Jiao Tong University Alan Turing Alan Turing (23Jun.1912-7Jun.1954), an English student of Church, introduced a machine model for effective calculation in On
More informationHUMAN COMPUTATION FROM A STRICTLY DYNAMICAL POINT OF VIEW
Cagliari Colloquium on the Extended Mind, Dynamicism, and Computation. Cagliari, June 10, 2013 HUMAN COMPUTATION FROM A STRICTLY DYNAMICAL POINT OF VIEW Marco Giunti - ALOPHIS, Università di Cagliari SUMMARY
More informationHIS LEGACY. 100 Years Turing celebration. Gordana Dodig Crnkovic, IDT Open Seminar. Computer Science and Network Department Mälardalen University
IDT Open Seminar AAN TUING AND HIS EGACY 00 Years Turing celebration http://www.mrtc.mdh.se/~gdc/work/turingcentenary.pdf http://www.mrtc.mdh.se/ mdh se/~gdc/work/turingmachine.pdf Gordana Dodig Crnkovic,
More informationGreat Ideas in Theoretical Computer Science
15-251 Great Ideas in Theoretical Computer Science Lecture 1: Introduction to the course Instructors Aug 29th, 2017 Teaching Assistants What is computer science? What is theoretical computer science? What
More informationComputational Tasks and Models
1 Computational Tasks and Models Overview: We assume that the reader is familiar with computing devices but may associate the notion of computation with specific incarnations of it. Our first goal is to
More informationHalting and Equivalence of Schemes over Recursive Theories
Halting and Equivalence of Schemes over Recursive Theories Dexter Kozen Computer Science Department, Cornell University, Ithaca, New York 14853-7501, USA Abstract Let Σ be a fixed first-order signature.
More informationIntroduction: Computer Science is a cluster of related scientific and engineering disciplines concerned with the study and application of computations. These disciplines range from the pure and basic scientific
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationThe Legacy of Hilbert, Gödel, Gentzen and Turing
The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon
More informationFoundations of Computation. Ana Bove
Foundations of Computation Ana Bove Programming Logic (ProgLog) Group February 13th 2018 Outline of the talk: What we do in ProgLog Origines of computer science Courses in the area Warming-up Exercise
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationTuring s Approaches to Computability, Mathematical Reasoning and Intelligence
English translation of a revised version of: C. Cellucci, Gli approcci di Turing alla computabilità e all intelligenza, in T. Orlandi (ed.), Per il centenario di Turing, fondatore dell informatica, Accademia
More informationThe decision problem (entscheidungsproblem), halting problem, & Turing machines. CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/
The decision problem (entscheidungsproblem), halting problem, & Turing machines CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/ 1 We must not believe those, who today, with philosophical bearing and
More informationComputational Models - Lecture 6
Computational Models - Lecture 6 Turing Machines Alternative Models of Computers Multitape TMs, RAMs, Non Deterministic TMs The Church-Turing Thesis The language classes R = RE core David Hilbert s Tenth
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationFoundational Analyses of Computation
Foundational Analyses of Computation Yuri Gurevich Microsoft Research, Redmond, Washington, USA Technical Report MSR-TR-2012-14, February 2012 Microsoft Research Microsoft Corporation One Microsoft Way
More informationFriendly Logics, Fall 2015, Lecture Notes 1
Friendly Logics, Fall 2015, Lecture Notes 1 Val Tannen 1 Some references Course Web Page: http://www.cis.upenn.edu/~val/cis682. I have posted there the remarkable On the Unusual Effectiveness of Logic
More informationTuring machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage?
Turing machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage? What is the most powerful of automata? In this lecture we will introduce
More information1 The decision problem for First order logic
Math 260A Mathematical Logic Scribe Notes UCSD Winter Quarter 2012 Instructor: Sam Buss Notes by: James Aisenberg April 27th 1 The decision problem for First order logic Fix a finite language L. Define
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936
ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM Turing 1936 Where are We? Ignoramus et ignorabimus Wir mussen wissen Wir werden wissen We do not know We shall not know We must know
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More information