New posts in computability

Index Sets are Cylinders

Tessellated space defines a recursive set?

geometry first-order-logic recursion computability

Is there a “nice” “constructive” field of numbers?

real-analysis computability constructive-mathematics

Good introductory books on primitive recursive functions

reference-request computability

Must a function that 'preserves r.e.-ness' be computable itself?

The field of algebraic numbers as a recursive structure

logic reference-request field-theory model-theory computability

A computer's memory is finite, so how can there be languages more powerful than regular?

computational-complexity computability formal-languages context-free-grammar regular-language

Can we describe any subsets of $\mathbb{N}$ occurring in a late layer of the Constructible Universe?

logic set-theory computability ordinals descriptive-set-theory

Is the logarithm of $\aleph_0$ infinite?

elementary-set-theory terminology cardinals computability

Is $S_R$ finitely generated?

abstract-algebra group-theory symmetric-groups computability finitely-generated

Primitive recursion and $\Delta^0_0$

logic computability recursion meta-math

Why is Q (Robinson arithmetic) both undecidable and axiomatizable?

logic arithmetic computability axioms decidability

The mother of all undecidable problems

logic computer-science computational-complexity computability turing-machines

Is there a "computable" countable model of ZFC?

logic model-theory computability

Are total recursive functions recursively enumerable?

Proving that the halting problem is undecidable without reductions or diagonalization?

computer-science computability

Why can Conway’s Game of Life be classified as a universal machine?

theory turing-machines turing-complete computability

Can one capture the properties of Turing machine using only function definitions?

computer-science computational-complexity computability

Gödel's Second Incompleteness Theorem and Arithmetically Non-Definable Theories

logic computability incompleteness peano-axioms

Every non-increasing sequence of polynomial towers stabilizes -- Finitary proof

number-theory logic algorithms computability