Questions about Turing computability and recursion theory, including the halting problem and other unsolvable problems. Questions about the resources required to solving particular problems should be tagged (computational-complexity).
Questions tagged [computability]
2192 questions
162
votes
1 answer
What properties of busy beaver numbers are computable?
The busy beaver function $\text{BB}(n)$ describes the maximum number of steps that an $n$-state Turing machine can execute before it halts (assuming it halts at all). It is not a computable function because computing it allows you to solve the…
Qiaochu Yuan
- 359,788
- 42
- 777
- 1,145
67
votes
6 answers
Are there any examples of non-computable real numbers?
Is this true, that if we can describe any (real) number somehow, then it is computable?
For example, $\pi$ is computable although it is irrational, i.e. endless decimal fraction. It was just a luck, that there are some simple periodic formulas to…
Dims
- 981
- 1
- 9
- 16
60
votes
3 answers
Recognizable vs Decidable
What is difference between "recognizable" and "decidable" in context of Turing machines?
metdos
- 887
- 2
- 8
- 10
40
votes
5 answers
Why do we believe the Church-Turing Thesis?
The Church-Turing Thesis, which says that the Turing Machine model is at least as powerful as any computer that can be built in practice, seems to be pretty unquestioningly accepted in my exposure to computer science. Why? Do we have any more…
GMB
- 4,016
- 1
- 17
- 32
39
votes
6 answers
In what sense does a number "exist" if it is proven to be uncomputable?
Uncomputable functions: Intro
The last month I have been going down the rabbit hole of googology (mathematical study of large numbers) in my free time. I am still trying to wrap my head around the seeming paradox of the existence of natural numbers…
Andreas
- 933
- 2
- 10
38
votes
6 answers
Example of uncomputable but definable number
Every computable number is definable. However, the converse is not true.
What is an example of a real number that is definable but that is NOT computable? I guess if it is there, we can "define" (describe) it, can't we?
islamfaisal
- 578
- 4
- 12
34
votes
3 answers
Can someone explain the Y Combinator?
The Y combinator is a concept in functional programming, borrowed from the lambda calculus. It is a fixed-point combinator. A fixed point combinator $G$ is a higher-order function (a functional, in mathematical language) that, given a function $f$,…
Chris Taylor
- 27,485
- 5
- 79
- 121
29
votes
6 answers
Is it possible to solve any Euclidean geometry problem using a computer?
By "problem", I mean a high-school type geometry problem.
If no, is there other set of axioms that allows that?
If yes, are there any software that does that?
I did a search, but was not able to find a single program that allows that. It is strange…
Artium
- 940
- 1
- 9
- 18
29
votes
1 answer
Computability viewpoint of Godel/Rosser's incompleteness theorem
How would the Godel/Rosser incompleteness theorems look like from a computability viewpoint?
Often people present the incompleteness theorems as concerning arithmetic, but some people such as Scott Aaronson have expressed the opinion that the…
user21820
- 53,491
- 7
- 84
- 231
28
votes
5 answers
Are some real numbers "uncomputable"?
Is there an algorithm to calculate any real number. I mean given $a \in \mathbb{R}$ is there an algorithm to calculate $a$ at any degree of accuracy ?
I read somewhere (I cannot find the paper) that the answer is no, because $\mathbb{R}$ is not a…
Ricky Bobby
- 713
- 8
- 15
27
votes
2 answers
Are transcendental numbers computable?
Wikipedia states: "The computable numbers include many of the specific real numbers which appear in practice, including all real algebraic numbers, as well as e, π, and many other transcendental numbers."
I remember my professor saying incomputable…
joker
- 429
- 6
- 10
27
votes
1 answer
How to interpret "computable real numbers are not countable, and are complete"?
On page 12 of this (controversial) polemic
http://web.maths.unsw.edu.au/~norman/papers/SetTheory.pdf
Wildberger claims that
Even the "computable real numbers" are quite misunderstood. Most mathematicians reading this paper suffer from the…
Stephen
- 13,232
- 1
- 35
- 47
25
votes
4 answers
Is chess Turing-complete?
Is there a set of rules that translates any program into a configuration of finite pieces on an infinite board, such that if black and white plays only legal moves, the game ends in finite time iff the program halts?
The rules are the same as…
coffeemachine
- 291
- 3
- 5
23
votes
13 answers
What is the fastest growing total computable function you can describe in a few lines?
What is the fastest growing total computable function you can describe in a few lines?
Well, not necessarily the fastest - I just would like to know how far an ingenious mathematician can go using only a few lines, and what systematic approaches…
Nik Z.
- 1,791
- 15
- 28
22
votes
3 answers
Density of halting Turing machines
If we enumerate all Turing machines, $T_1$, $T_2$, $T_3,\ldots,T_n,\ldots$,
What is
$$\lim_{m\to\infty}\frac{\#\{k\mid k\lt m \text{ and }T_k\text{ halts}\}}{m}\quad?$$
Or does this depend on how we enumerate them ?
awesom-o
- 241
- 2
- 6