Handbook of computability theory
[The articles of this volume will be reviewed individually.] The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little to the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers. Indexed articles: \textit{Soare, Robert I.}, The history and concept of computability, 3-36 [Zbl 0948.03038] \textit{Cenzer, Douglas}, \(\Pi_1^0\) classes in computability theory, 37-85 [Zbl 0939.03047] \textit{Odifreddi, Piergiorgio}, Reducibilities, 89-119 [Zbl 0945.03065] \textit{Cooper, S. Barry}, Local degree theory, 121-153 [Zbl 0944.03035] \textit{Slaman, Theodore A.}, The global structure of the Turing degrees, 155-168 [Zbl 0944.03034] \textit{Shore, Richard A.}, The recursively enumerable degrees, 169-197 [Zbl 0947.03061] \textit{Soare, Robert I.}, An overview of the computably enumerable sets, 199-248 [Zbl 0939.03045] \textit{Normann, Dag}, The continuous functionals, 251-275 [Zbl 0965.03058] \textit{Chong, C. T.; Friedman, S. D.}, Ordinal recursion theory, 277-299 [Zbl 0947.03063] \textit{Sacks, Gerald E.}, \(E\)-recursion, 301-314 [Zbl 0947.03064] \textit{Hinman, Peter G.}, Recursion on abstract structures, 315-359 [Zbl 0946.03054] \textit{Stoltenberg-Hansen, V.; Tucker, J. V.}, Computable rings and fields, 363-447 [Zbl 0944.03040] \textit{Pour-El, Marian Boykan}, The structure of computability in analysis and physical theory: An extension of Church's thesis, 449-471 [Zbl 0945.03091] \textit{Ershov, Yuri L.}, Theory of numberings, 473-503 [Zbl 0948.03040] \textit{Millar, Terrence S.}, Pure recursive model theory, 507-532 [Zbl 0940.03046] \textit{Schwichtenberg, Helmut}, Classifying recursive functions, 533-586 [Zbl 0978.03035] \textit{Clote, P.}, Computation models and function algebras, 589-681 [Zbl 0942.68049] \textit{Ambos-Spies, Klaus}, Polynomial time reducibilities and degrees, 683-705 [Zbl 0941.03043]
- Computations via Newtonian and relativistic kinematic systems
- Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
- Classical recursion theory. Vol. II
- The polynomial hierarchy of functions and its levels
- Decidability and \(k\)-regular sequences
- Modeling multitape Minsky and Turing machines by three-tape Minsky machines
- Weighted G-Drazin inverses and a new pre-order on rectangular matrices
- ^0_1-presentations of algebras
- A splitting theorem for n-REA degrees
- On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set
- Computational classification of cellular automata
- General computability theory (a database of articles and books)
- On Constructive Nilpotent Groups
- Computability and models. Perspectives east and west
- Programming Experimental Procedures for Newtonian Kinematic Machines
- Bounding minimal degrees by computably enumerable degrees
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Hyperfinite type structures
- Handbook of computability and complexity in analysis
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
- Computability. Randomness, reverse mathematics and hypercomputability
- Primitive recursive equivalence relations and their primitive recursive complexity
- An incomplete set of shortest descriptions
- Finitely presented expansions of groups, semigroups, and algebras
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Computability and Recursion
- Lawvere-Tierney topologies for computability theorists
- An effectively closed set with no join property*
- Numberings, c.e. oracles, and fixed points
- Effectiveness in RPL, with applications to continuous logic
- On arithmetical numberings in reverse mathematics
- Computability of analog networks
- Introduction to Turing categories
This page was built for publication: Handbook of computability theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307021)
