This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes of equivalence relations under computable reducibility. In Chapters 3 and 4 we examine the bounded jump operator and the notion of highness for the bounded jump. In Chapter 5 we look at different ways of effectivizing the properties of a dominant function.Doctor of Philosophy (SPMS
We describe a programme of research which aims to find natural definability results in the Turing de...
In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungspro...
AbstractA real number x is f-bounded computable (f-bc, for short) for a function f if there is a com...
Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence ...
Computable reducibility is a well-established notion that allows to compare the complexity of variou...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
We explore various areas of computability theory, ranging from applications in computable structure ...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
Computability Theory: An Introduction provides information pertinent to the major concepts, construc...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
We study computably enumerable equivalence relations (ceers), under the reducibility R ≤ S if there ...
In this article, we will show that uncomputability is a relative property not only of oracle Turing ...
We describe a programme of research which aims to find natural definability results in the Turing de...
In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungspro...
AbstractA real number x is f-bounded computable (f-bc, for short) for a function f if there is a com...
Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence ...
Computable reducibility is a well-established notion that allows to compare the complexity of variou...
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction ...
We explore various areas of computability theory, ranging from applications in computable structure ...
I A function f is computable if there is Turing Machine which computes it. I Using Oracle Turing mac...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
Computability Theory: An Introduction provides information pertinent to the major concepts, construc...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
We study computably enumerable equivalence relations (ceers), under the reducibility R ≤ S if there ...
In this article, we will show that uncomputability is a relative property not only of oracle Turing ...
We describe a programme of research which aims to find natural definability results in the Turing de...
In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungspro...
AbstractA real number x is f-bounded computable (f-bc, for short) for a function f if there is a com...