Complexity, Logic, and Recursion Theory
- ISBN-10
- 1482269759
- ISBN-13
- 9781482269758
- Category
- Mathematics
- Pages
- 380
- Language
- English
- Published
- 2019-05-07
- Publisher
- CRC Press
- Author
- Andrea Sorbi
Description
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
Get the book
Other editions
Similar books
-
Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997
By Marat M. Arslanov, Steffen LemppThe series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications.
-
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
By Martin Davis, Elaine J. Weyuker, Ron SigalMichael Harrison, Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978. A comprehensive, up-to-date, readable treatise on formal languages. Karel Hrbacek and Thomas Jech, Introduction to Set Theory, ...
-
Bounded Queries in Recursion Theory
By Georgia Martin, William LevineOne of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are.
-
Abstract Recursion and Intrinsic Complexity
By Yiannis N. MoschovakisPresents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.
-
Ω-Bibliography of Mathematical Logic: Recursion Theory
By Peter G. HinmanΩ-Bibliography of Mathematical Logic: Recursion Theory
-
Recursion Theory Week: Proceedings of a Conference Held in Oberwolfach, FRG, March 19-25, 1989
By Klaus Ambos-Spies, Gert H. MüllerThese proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field....
-
Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
By Noam Greenberg, Alexander Melnikov, Adam DaySoc. 368, 1321– 1359 (2016) Downey, R.: On presentations of algebraic structures. In: Sorbi, A. (ed.) Complexity, Logic, and Recursion Theory, pp. 157–205. Dekker, New York (1997) Downey, R.G.: Computability theory and linear orderings.
-
Handbook of Computability Theory
By E.R. GrifforA. NIES [1997] A uniformity of degree structures, in: Complexity, Logic and Recursion Theory, A. Sorbi, ed., Lecture Notes in Pure and Applied Mathematics, Vol. 187, Marcel Dekker, New York, pp. 261– 267. [ta] Effectively dense Boolean ...
-
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
By Martin D. Davis, Elaine J. WeyukerAnother inference: Every shark eats a tadpole; all large white fish are sharks; some large white fish live in deep water; any tadpole eaten by a deep water fish is miserable; therefore, some tadpoles are miserable. Our vocabulary is {s, ...
-
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers
By Piergiorgio OdifreddiVolume II of ITClassical Recursion Theory/IT describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets....