Search Results

First, there are sets with minimal weak truth table degree which bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with c

This book constitutes the second volume of interviews with prominent mathematicians and mathematical scientists who visited the Institute for Mathematical Scien

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of