# Questions tagged [turing-machines]

The turing-machines tag has no usage guidance.

4
questions

**3**

votes

**2**answers

436 views

### Are ITTM's necessary to compute Turing's “computable numbers” and what does that mean for ordinary recursion theory?

In his celebrated paper, "On Computable Numbers, With An Application To the Entscheidungsproblem", Turing defines a "computable number" as follows:
The "computable" ...

**27**

votes

**3**answers

3k views

### What sorts of extra axioms might we add to ZFC to compute higher Busy Beaver numbers?

First, some context. Ever since I was a high schooler, I have been fascinated with large numbers. As I have grown in mathematical maturity, I have become both disappointed and fascinated to see that ...

**2**

votes

**0**answers

104 views

### Is Steiner symmetrization “Turing complete”?

This question stems from intuition so it is a little soft. It concerns performing computation using transformations on sets. The idea is that a rearrangement like Steiner symmetrization might be "...

**3**

votes

**1**answer

522 views

### Proof that dynamical systems with bounded Kolmogorov complexity can't emulate all Turing machines

Motivation:
During a discussion with neuroscientists the question arose as to whether the human brain may emulate any Turing machine. If we assume that animal brains may be modelled as deterministic ...