Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

2.2 Alonzo Church
3.2.3 The Flaw in Church’s Thesis
3.2.4 G¨odel on Church’s Thesis
3.2.5 G¨odel’s Letter to Kreisel [1968]
3.2.6 Gibbs Lecture [1951]
4 Oracle Machines and Relative Computability
4.1 Turing’s Oracle Machines
4.2 Modern Definitions of Oracle Machines
4.2.1 The Graph of a Partial Computable Function
4.2.2 The Graph of an Oracle Computable Functional
4.3 The Oracle Graph Theorem
4.4 Equivalent Definitions of Relative Computability
4.4.1 Notation for Functions and Functionals
5 Emil Post Expands Turing’s Ideas
5.1 Post’s Work in the 1930’s
5.2 Post Steps Into Turing’s Place During 1940–1954
5.3 Post’s Problem on Incomplete C.E. Sets
5.4 Post Began With Strong Reducibilities
6 Post Highlights Turing Computability
6.1 Post Articulates Turing Reducibility
6.2 The Post-Turing Thesis
7 Continuous and Total Functionals
7.1 Representations of Open and Closed Sets
7.2 Notation for Trees
7.3 Dense Open Subsets of Cantor Space
7.4 Effectively Open and Closed Sets
7.5 Continuous Functions on Cantor Space
7.6 Effectively Continuous Functionals
7.7 Continuous Functions are Relatively Computable
8 Bounded Reducibilities
8.1 A Matrix Mx for Bounded Reducibilities
8.2 Bounded Turing Reducibility
8.3 Truth-Table Reductions
8.4 Difference of c.e. sets, n-c.e., and ω-c.e. sets
9 Online Computing
9.1 Turing Machines and Online Processes
9.2 Trial and Error Computing
9.3 The Limit Lemma
9.4 Two Models for Computing With Error
9.4.1 The Limit Computable Model
9.4.2 The Online Model
10 Three Displacements in Computability Theory
11 “Computable” versus “Recursive”
11.1 Church Defends Church’s Thesis with “Recursive”
11.2 Church and Kleene Define “Recursive” as “Computable”
11.3 G¨odel Rejects “Recursive Function Theory”
11.4 The Ambiguity in the Term “Recursive”
11.5 Changing “Recursive” Back to “Inductive”
12 Renaming it the “Computability Thesis?”
12.1 Kleene Called it “Thesis I” in [1943]
12.2 Kleene Named it “Church’s thesis” in [1952]
12.3 Kleene Dropped “Thesis I” for “Church’s thesis”
12.4 Evidence for the Computability Thesis
12.5 Who First Demonstrated the Computability Thesis?
12.6 The Computability Thesis and the Calculus
12.7 Founders of Computability and the Calculus
13 Turing a-machines versus o-machines?
13.1 Turing, Post, and Kleene on Relative Computability
13.2 Relative Computability Unifies Incomputability
13.3 The Key Concept of the Subject
13.4 When to Introduce Relative Computability
14 Conclusions
0 of .
Results for:
No results containing your search query
P. 1


|Views: 94|Likes:
Published by Jiang Yuan Tay

More info:

Published by: Jiang Yuan Tay on Jul 25, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 4 to 17 are not shown in this preview.
You're Reading a Free Preview
Pages 21 to 70 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->