Complexity, Logic, and Recursion Theory
- ISBN-10
- 0429529953
- ISBN-13
- 9780429529955
- 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
-
Abstract Recursion and Intrinsic Complexity
By Yiannis N. MoschovakisThis book presents and applies a framework for studying the complexity of algorithms.
-
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.
-
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
By Cyrus F. NouraniThis book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the ...
-
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, ...
-
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.
-
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....
-
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.
-
Ω-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, West Germany, April 15-21, 1984
By Heinz-Dieter Ebbinghaus, Gerald E. Sacks, Gert H. MüllerAnnotation These 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...
-
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.