New posts in computability

How does Borelness overlap with definability, computability, or constructiveness?

Consistency strength of Turing measurability

Gödel's completeness theorem and the undecidability of first-order logic

How can know if a proof technique can actually prove something? Specifically, induction

Can we compute all digits of the Euler-Mascheroni constant?

Is the theory of the category of topological spaces computable?

What philosophical consequence of Goedel's incompleteness theorems?

Is there such a thing as a countable set with an uncountable subset?

The range of a non-computable function that grows faster than computable functions is undecidable

Explicit automorphisms of the field of algebraic numbers

Primitive recursive function which isn't $\Delta_0$

Lambda Calculus Beta reductions

finding the computable function in s-m-n theorem.

Is there a rote algorithm to tell whether a tensor (of two vectors) can be reduced to an elementary tensor?

How can Busy beaver($10 \uparrow \uparrow 10$) have no provable upper bound?

Mathematical Notation and its importance

Density of halting Turing machines

Given any computable number, is there any algorithm to decide whether it is transcendental?

Is the Collatz conjecture in $\Sigma_1 / \Pi_1$?

Running an infinite amount of Turing Machine steps in a finite amount of time: What consequences?