New posts in computability

Does the recursion theorem give quines?

explicit upper bound of TREE(3)

Countable choice and term extraction

The word problem for finite groups

Reference on standard types

What is the relationship between ZFC and Turing machine?

A result of van der Waerden says Galois theory "needs" incomputable sets - what does this mean, exactly?

Recognizing and Using Chaitin's Constant

Why does the fixed point theorem justify the existence of the factorial function?

Why are $\Delta_1$ sentences of arithmetic called recursive?

Prove Gödel's incompleteness theorem using halting problem

What is undecidability

Fixed points in computability and logic

When is Chaitin's constant normal?

Algorithm to answer existential questions - Reduction

Any advantages of using Gödel universal functions in proving unsolvability?

"Proof" that ZFC is inconsistent using Turing machines

What is the difference between total recursive and primitive recursive functions

How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?

Tennenbaum's theorem without overspill