New posts in Computability Theory

Are the vertical sections of the Ackermann function primitive recursive?

Infinite descending chain of Turing jumps with equality

Checking for finite fibers in hash functions

Why is uncomputability of the spectral decomposition not a problem?

Is the collection of primitive recursive functions a lower set in the poset of computable functions?

The Lucas argument vs the theorem-provers -- who wins and why?

Does ZF+AD have any unusual arithmetic consequences?

Do "seemingly impossible functional programs" work with arrow types interpreted as Turing machines?

Is Post's tag system solved?

Progress towards a computational interpretation of the univalence axiom?