Handbook of Computability Theory - researchr publication

researchr

You are not signed in
Sign in
Sign up

Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, North-Holland, 1999. [doi]

Abstract is missing.

PrefaceEdward R. Griffor. [doi]

The History and Concept of ComputabilityRobert I. Soare. 3-36 [doi]

∏10 Classes in Computability TheoryDouglas Cenzer. 37-85 [doi]

ReducibilitiesPiergiorgio Odifreddi. 89-119 [doi]

Local Degree TheoryS. Barry Cooper. 121-153 [doi]

The Global Structure of the Turing DegreesTheodore A. Slaman. 155-168 [doi]

The Recursively Enumerable DegreesRichard A. Shore. 169-197 [doi]

An Overview of the Computably Enumerable SetsRobert I. Soare. 199-248 [doi]

The Continuous FunctionalsDag Normann. 251-275 [doi]

Ordinal Recursion TheoryC. T. Chong, Sy D. Friedman. 277-299 [doi]

E-recursionGerald E. Sacks. 301-314 [doi]

Recursion on Abstract StructuresPeter G. Hinman. 315-359 [doi]

Computable Rings and FieldsViggo Stoltenberg-Hansen, John V. Tucker. 363-447 [doi]

The Structure of Computability in Analysis and Physical TheoryMarian Boykan Pour-El. 449-471 [doi]

Theory of NumberingsYuri Leonidovich Ershov. 473-503 [doi]

Pure Recursive Model TheoryTerrence Millar. 507-532 [doi]

Classifying Recursive FunctionsHelmut Schwichtenberg. 533-586 [doi]

Computation Models and Function AlgebrasPeter Clote. 589-681 [doi]

Polynomial Time Reducibilities and DegreesKlaus Ambos-Spies. 683-705 [doi]

runs on WebDSL