Add to ORKGCentral concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular. A second group of topics has to do with generalizations of recursion theory. The third topics group mentioned is subrecursive computability and subrecursive hierarchie
AbstractA strong connection is established between the structural and the looking back techniques fo...
In this article, we will show that uncomputability is a relative property not only of oracle Turing ...
The characterization of program structure is an elusive aspect of the theory of programming language...
theory. 2. Relative computability: degrees of unsolvability 3. Uniform relative computability: parti...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
Computability Theory: An Introduction provides information pertinent to the major concepts, construc...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
These proceedings contain research and survey papers from many subfields of recursion theory, with e...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of t...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
When several axiom schemes can serve equally well in defining a theory, one generally seeks that axi...
AbstractA strong connection is established between the structural and the looking back techniques fo...
In this article, we will show that uncomputability is a relative property not only of oracle Turing ...
The characterization of program structure is an elusive aspect of the theory of programming language...
theory. 2. Relative computability: degrees of unsolvability 3. Uniform relative computability: parti...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
The theory of computability, or basic recursive function theory as it is often called, is usually m...
Computability Theory: An Introduction provides information pertinent to the major concepts, construc...
AbstractThe theory of computability, or basic recursive function theory as it is often called, is us...
These proceedings contain research and survey papers from many subfields of recursion theory, with e...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of t...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
When several axiom schemes can serve equally well in defining a theory, one generally seeks that axi...
AbstractA strong connection is established between the structural and the looking back techniques fo...
In this article, we will show that uncomputability is a relative property not only of oracle Turing ...
The characterization of program structure is an elusive aspect of the theory of programming language...