Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

The Journal of Symbolic Logic (JSL) was founded in 1936 and it has become the leading research journal in the field. It is issued quarterly. Volume 71, being published during 2006, will consist of ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

At a job interview on Friday, I had to write code, and one of the things that came up when we were talking about implementation of a concept was recursion. The director of the group said to me "Don't ...