MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What are the most attractive Turing undecidable problems in mathematics?

There are thousands of examples, so please post here only the most attractive, best examples. Some examples already appear on the Wikipedia page.

Standard community wiki rules. One example per post please. I will accept the answer I find to be the most attractive, according to the following criteria:

  • Examples must be undecidable in the sense of Turing computability. (Please not that this is not the same as the sense of logical independence; think of word problem, not Continuum Hypothesis.)

  • The best examples will arise from natural mathematical questions.

  • The best examples will be easy to describe, and understandable by most or all mathematicians.

  • (Challenge) The very best examples, if any, will in addition have intermediate Turing degree, strictly below the halting problem. That is, they will be undecidable, but not because the halting problem reduces to them.

Edit: This question is a version of a previous question by Qiaochu Yuan, inquiring which problems in mathematics are able to simulate Turing machines, with the example of the MRDP theorem on diophantine equations, as well as the simulation of Turing machines via PDEs. He has now graciously merged his question here.

share|cite|improve this question
I guess Qiaochu's question dissapeared in the process of being merged? Can someone post the link regarding PDE's that was on his question? – Mariano Suárez-Alvarez Jan 12 '10 at 19:40

42 Answers 42

The mortality problem for $3\times 3$ matrices: given a finite set $F$ of $3\times 3$ integer matrices, decide whether the zero matrix is a product of members of $F$ (with repetitions allowed). This was proved unsolvable by Michael Paterson, Studies in Applied Mathematics 49 (1970), 105--107.

The corresponding problem for $2\times 2$ matrices is apparently still open.

share|cite|improve this answer
... or just two $21 \times 21$ matrices – Vladimir Reshetnikov Nov 29 '11 at 5:57
Interesting ... I hadn't heard that result. Do you have a reference? – John Stillwell Nov 29 '11 at 17:40
Halava, V.; Harju, T.; Hirvensalo, M. (2007). "Undecidability Bounds for Integer Matrices Using Claus Instances". International Journal of Foundations of Computer Science 18 (5): 931–948.… – Vladimir Reshetnikov Jul 30 '12 at 0:00
@Vladimir: Thanks! – John Stillwell Jul 30 '12 at 4:27
Note the recent preprint which improves these results. Undecidability now holds for five 3*3 matrices or two 15*15 matrices. – subshift Feb 17 '14 at 14:36

As I mentioned in the other thread, Matiyasevich's theorem implies that it is undecidable whether a system of Diophantine equations over $\mathbb{Z}$ has a solution (Hilbert's 10th Problem). I have to mention some related results here: if $\mathbb{Z}$ is replaced by $\mathbb{F}_p[t]$ then the problem is still not decidable, if replaced by $\mathbb{R}, \mathbb{C}, \mathbb{Q}_p$ then the problem is decidable, and if replaced by $\mathbb{Q}$ or $\mathbb{F}_p((t))$ the answer is not known! (Reference.) I believe it is not even known whether the answer is yes for some number fields but no for others (which would be truly bizarre).

share|cite|improve this answer
Thanks very much, Qiaochu, for moving your question over here. I appreciate it, and I think we'll get a good list. – Joel David Hamkins Jan 12 '10 at 17:27
I find these results really interesting; in a way it shows why analysis is so successful. – Sam Derbyshire Jan 12 '10 at 20:13

I'm surprised nobody's mentioned the Post correspondence problem. Like the tiling problem, it seems like something so basic, there has to be some simple way to brute-force it... but no.

share|cite|improve this answer
I second this problem, which is the gateway to many other unsolvability proofs, such as the one for the mortality problem for $3\times 3$ matrices. – John Stillwell Jun 3 '10 at 23:01
Note that (mentioned in comments to another answer) also proves PCP undecidable even when restricted to only four pairs of binary words. – r.e.s. Jul 29 '15 at 15:13

The Word Problem for groups is undecidable. This is the problem, given a finite group presentation and a word, to decide if that word is the group identity in that presentation. The problem is undecidable because one may encode the Halting problem for Turing machines. Basically, for each Turing machine program, one can construct a group presentation and a word, such that the program halts if and only if that word is the identity.

share|cite|improve this answer
Closely related is that computing $H^2$ of a finitely-presented group is impossible: Gordon, C. Some embedding theorems and undecidability questions for groups. Combinatorial and geometric group theory (Edinburgh, 1993), 105--110, London Math. Soc. Lecture Note Ser., 204, Cambridge Univ. Press, Cambridge, 1995. – Ryan Budney Jan 12 '10 at 18:03
There are numerous closely related problems. The conjugacy problem, for example, is the problem of deciding whether two words are conjugate in a given presentation. Also: deciding the order of a group element or deciding whether the order exceeds a given number. – Joel David Hamkins Jan 13 '10 at 14:21
John, Victor's argument is computably reducing the conjugacy problem for one presentation to the word problem of another presentation. – Joel David Hamkins May 25 '10 at 12:08
Joel, I take your point. I was thinking that a solvable word problem would remain solvable when a relation $x=1$ is added, but on second thoughts this is not clear. Nonetheless, I'm still dubious about Victor's proposed reduction. If $y=1$ in "$G$ plus $x=1$" it could be, e.g., that $y=zx^{2}z^{-1}$ in $G$, so $y$ is conjugate to $x^2$ but not necessarily to $x$. – John Stillwell May 26 '10 at 3:05
John, yes, I think you are right. In general, however, the conjugacy problem for arbitrary presentations (and not just one fixed presentation) does reduce to the word problem for arbitrary presentations, since both are equivalent to the halting problem. That is, the halting problem famously reduces to the word problem, which reduces to the conjugacy problem as I explained, but this clearly reduces to the halting problem since it is $\Sigma_1$. – Joel David Hamkins May 26 '10 at 3:35

The Halting Problem, the mother of them all.

share|cite|improve this answer
Is there an undecidable problem that is actually weaker than the halting problem? Most of the problems stated here can be solved using a halting problem oracle, but also the halting problem can be solved using an oracle for them. Is there an undecidable problem X that can be solved using a halting problem oracle, but the halting problem cannot be solved with an X-oracle? – Christoph-Simon Senjak Aug 26 '14 at 9:49
@Christoph-SimonSenjak Yes, there are such intermediate problems, strictly between the decidable sets and the halting problem. There is a c.e. problem that is not decidable, but which is not Turing-equivalent to the halting problem. This is the solution of Post's problem, solved by Friedburg-Muchnik. See…. – Joel David Hamkins Aug 26 '14 at 9:53
@Christoph-SimonSenjak – Andrew MacFie Mar 8 at 23:16

The Tiling problem is undecidable. This is the problem, given a finite set of tile types, to determine whether there is an arrangement of them with adjacent sides matching that tiles the plane. The problme is undecidable because the Halting problem for Turing machines reduces to it, in the sense that every Turing machine program corresponds to a tiling problem, which has a tiling if and only if the program fails to halt. Basically, the run of the machine is encoded into the tiling, which can continue as long as the program keeps running.

share|cite|improve this answer
Moreover, the tiling extension problem is undecidable: can a tiling of a part of the plane be extended to the whole plane? There are some interesting examples of partial Penrose tilings with many pieces which are non-extendable in a non-obvious way. – Victor Protsak May 25 '10 at 4:11
This has a consequence of interest to 3-manifold topologists, concerning branched surfaces --- a branched surface is a compact 2-complex such that at each point $x$ there is a well-defined "tangent plane", and there exists a smoothly embedded open disc containing $x$. Ramin Naimi (unpublished) proved that if a branched surface is embeddable in a 3-manifold then it is decidable whether every 2-cell is in the image of a complete immersion of $R^2$. However, for abstract branched surfaces, this is undecidable, because every tiling problem can be encoded as an abstract branched surface. – Lee Mosher Mar 28 '12 at 16:35

Let $n\geq 3$. Given two embeddings of $S^n$ into $\mathbb{R}^{n+2}$, the problem of determining whether they are equivalent (via a deformation of $\mathbb{R}^{n+2}$) is undecidable (the case $n=2$ is open; for $n=1$ an algorithm exists).

By the way, Bjorn Poonen has a wonderful talk on this topic, titled Undecidability Everywhere.

share|cite|improve this answer
What kind of deformation of $\mathbb{R}^{n+2}$? – Joey Hirsh Jan 12 '10 at 20:31
An ambient isotopy – Ben Linowitz Jan 12 '10 at 20:37
It's still undecidable up to an ambient homeomorphism. And the undecidablility is again a fundamental group issue -- there's a certain type of group presentation called a Wirthinger presentation. Given any such presentation there's an algorithm to construct a knot ($n>2$) such that $\pi_1$ of the complement has that Wirthinger presentation. – Ryan Budney Jan 12 '10 at 20:57

Richardson's theorem says that it is undecidable to tell whether an expression $E$ satisfies $E=0$, where $E$ is generated by $\mathbb{Q}\cup\{\pi,\ln 2,x\}$ and the composition of operations in $\{+,-,\times,\sin,\exp, \mathrm{abs}\}$.

(I thought this deserves its own answer, even if it's given as a comment on this other answer.)

share|cite|improve this answer
Is the problem known to become decidable if $\operatorname{abs}$ is removed from the allowed operations? – David Zhang Nov 21 '15 at 15:38
@DavidZhang yes, combining some later results (see and, we can remove the dependence on $\ln 2$, $\mathrm{abs}$ and $\exp$. – Diego de Estrada Nov 26 '15 at 15:34

Is a given computable function $f:\mathbb{R}\to\mathbb{R}$ differentiable?

OK, I'll have to (1) clarify what I mean and (2) show it's not a completely trivial consequence of the halting problem.

Part (1):

I have to define computability of $f$. Say that a Turing machine computes a real $x$ if, given any input $n$, it always returns a sequence of $n$ rational numbers, with the $i$th element within $2^{-i}$ of $x$. In other words, it computes the initial part of a Cauchy sequence approximating $x$ to a predetermined accuracy.

Now we can say that a machine $X$ computes $f:\mathbb{R}\to\mathbb{R}$ if for any $x$, you can give it a description of a Turing machine to compute $x$ as an input, and always gives you back another one that computes $f(x)$.

It is impossible to make a machine that takes a description of a machine $X$ to compute $f$, and tells you if the function $f$ is differentiable, i.e. differentiability is undecidable.

But, you say, that's trivial. After all, the machine $X$ we're passing in as argument is, obviously, a machine, so we expect to meet the halting problem. So contrast with:

Part (2): Integration over an interval is computable.

(I've probably made some typos in the above as it's not my field. So try Computable Analysis for more details.)

share|cite|improve this answer
This is very similar to the fact that the pushforward of sheaves is easier to define, but the inverse image sheaf is significantly easier to computte. – Harry Gindi Apr 25 '10 at 15:49
Is there a direct analogy? And is the inverse image easy to compute in some formal sense? I also assume you're refering to $Rf_*$, not $f_*$. – Daniel Litt Jun 24 '10 at 19:22
This is an extremely nice example! One question: as you point out, it’s not a trivial reduction to the halting problem. But the proof is still, in the end, a (non-trivial) reduction to the halting problem, right? This isn’t an example of an intermediate Turing degree, is it? – Peter LeFanu Lumsdaine Feb 18 '11 at 15:38
I would expect integration to be easier than differentiation, because every computable function is continuous and every continuous function is integrable (on a compact interval). Thus to decide if a computable function is integrable is trivially computable: always return Yes. To actually calculate the integral computably is harder but seems likely to work (and I happen to know that it does). – Toby Bartels Jul 28 '12 at 23:36
In contrast, not every continuous function is differentiable, so to decide if a computable function is differentiable (much less to decide if it's computably differentiable and if so to compute its derivative) might be impossible. And so it is. – Toby Bartels Jul 28 '12 at 23:37

There is no algorithm that given a positive integer $K$ can decide if the following concrete Diophantine equation has a solution over non-negative integers:

\begin{align}&(elg^2 + \alpha - bq^2)^2 + (q - b^{5^{60}})^2 + (\lambda + q^4 - 1 - \lambda b^5)^2 + \\ &(\theta + 2z - b^5)^2 + (u + t \theta - l)^2 + (y + m \theta - e)^2 + (n - q^{16})^2 + \\ &((g + eq^3 + lq^5 + (2(e - z \lambda)(1 + g)^4 + \lambda b^5 + \lambda b^5 q^4)q^4)(n^2 - n) + \\ &(q^3 - bl + l + \theta \lambda q^3 + (b^5-2)q^5)(n^2 - 1) - r)^2 + \\ &(p - 2w s^2 r^2 n^2)^2 + (p^2 k^2 - k^2 + 1 - \tau^2)^2 + \\ &(4(c - ksn^2)^2 + \eta - k^2)^2 + (r + 1 + hp - h - k)^2 + \\ &(a - (wn^2 + 1)rsn^2)^2 + (2r + 1 + \phi - c)^2 + \\ &(bw + ca - 2c + 4\alpha \gamma - 5\gamma - d)^2 + \\ &((a^2 - 1)c^2 + 1 - d^2)^2 + ((a^2 - 1)i^2c^4 + 1 - f^2)^2 + \\ &(((a + f^2(d^2 - a))^2 - 1) (2r + 1 + jc)^2 + 1 - (d + of)^2)^2 + \\ &(((z+u+y)^2+u)^2 + y-K)^2 = 0. \end{align}
share|cite|improve this answer
This sort of thing always shocks me. – Mariano Suárez-Alvarez Jul 29 '12 at 1:13
What is a source for this? Does this equation mean or represent anything? – Bruno Jul 29 '12 at 12:07
This Diophantine equation can encode any r.e. set. It is derived from "Undecidable diophantine equations" by James P. Jones, Bull. Amer. Math. Soc. (N.S.) Volume 3, Number 2 (1980), 859-862.… – Vladimir Reshetnikov Jul 29 '12 at 14:56
It is clear that there is a Diophantine equation of power 4 with the same property (just add enough auxiliary variables and clauses of the form $(v_1 - v_2 v_3)^2$), but it is unknown if there is one of power 3. – Vladimir Reshetnikov Jul 29 '12 at 21:24

The problem of distinguishing two manifolds (up to homeomorphism, or even homotopy equivalence Edit: given a triangulation) is undecidable. This follows from the word problem applied to fundamental groups.

There are similar problems concerning simplicial complexes, e.g., whether a given complex is a triangulation of a manifold.

share|cite|improve this answer
Distinguishing two manifolds given what information? How do you "give" somebody two manifolds, and ask them if they are homotopy equivalent? Do you mean if I give you an atlas for each manifold? Because I would still say this is a problem with distinguishing between representations. – Steven Gubkin Jan 12 '10 at 18:53
There are many ways of making a precise statement. You could give a simplicial complex underlying a manifold. Or a handlebody decomposition (e.g. a Kirby diagram for a 4-manifold). Or even a finite list of polynomial equations with integer coefficients (whether this accounts for all manifolds doesn't really matter). – Tim Perutz Jan 12 '10 at 19:16
Sorry, I was being very sloppy. – S. Carnahan Jan 12 '10 at 20:07
An interesting special case is the problem of recognizing the $n$-sphere, proved unsolvable for $n\ge 5$ by S.P. Novikov in 1962. Incidentally, S.P. Novikov is the son of P.S. Novikov, who proved the unsolvability of the word problem for groups. – John Stillwell May 24 '10 at 22:34
@John Stillwell: but I guess we can see from this example that the group on the generators ‘S’, ‘P’, and ‘Novikov’ does not prove that P.S = S.P! – Peter LeFanu Lumsdaine Feb 18 '11 at 15:36

Two open problems in this area that I like:

  1. (related to the Tiling Problem mentioned by Hamkins) Is it undecidable whether a polyomino (as defined e.g. at tiles a rectangle? If $P$ is a polyomino that tiles a rectangle, let $f(P)$ be the least number of copies of $P$ that are needed to tile a rectangle, and let $p(n)$ be the maximum of $f(P)$ over all polynominoes with $n$ squares that tile a rectangle. If the answer to the question is positive (which is what people in the area believe and is sometimes erroneously claimed to be known), then $p(n)$ grows faster than any recursive function!

  2. Let $F(x)=P(x)/Q(x)$ such that $P(x)$ and $Q(x)$ are polynomials with integer coefficients and $Q(0)\neq 0$. Is it undecidable that the Taylor series expansion of $F(x)$ at $x=0$ has a zero coefficient?

share|cite|improve this answer
It's staggering to learn that 2 does not have an easy decision procedure! I suppose that it has to do with diophantine properties of complex PF numbers (algebraic numbers with at least one conjugate with the same absolute value and none with larger). – Victor Protsak May 25 '10 at 4:00

Four from Compiler Science:

  1. Does a program ever access an uninitialized variable.
  2. Do two context free grammars describe the same langauge.
  3. Does it make a difference if parameters to a subroutine are passed by reference or by copy-result
  4. Deadlock determination in parallel programs.

Actually almost every question of the form "Does a program ever do X?" is equivalent to the halting probelm. So the above might be considered too close the the halting problem to be interesting answers ot this question.

share|cite|improve this answer
I don't find it a flaw to be close to or equivalent to the halting problem. After all, in a robust sense I think all the answers posted here so far are equivalent to the Halting problem, in the sense of Turing equivalence. Undecidability in the cases of the answers is established ultimately by reducing the Halting problem to the given problem, and conversely, for each problem one can reduce it to the Halting problem. So all the posted problems have the same Turing degree as the Halting Problem. – Joel David Hamkins Jan 13 '10 at 13:18
Aren't these just special cases of Rice's Theorem? – Christoph-Simon Senjak Mar 7 '13 at 21:41
@Christoph - no, Rice's theorem says we cannot decide nontrivial things about a the language of a program, but #1,3,4 do not deal with the program's language and #2 does not get programs as input. – usul Jun 18 '13 at 20:47

Team games, as defined in Bob Hearn's thesis or the book Games, Puzzles, and Computation. These are games, like bridge, in which there are two teams playing against each other and each team has several players who do not have complete information about the game. The astounding thing is that even though there are only finitely many game states, it is undecidable to determine whether there is a winning strategy. This seeming paradox arises because the players do not necessarily know that the game state has returned to a previous state, and a winning strategy can in principle depend on the entire history of the game. I like this one because it takes some effort even to understand why it it not trivially decidable.

share|cite|improve this answer
Nice. I like the 1-PFA problem for the same reason. – SBH Jul 2 '10 at 9:55
See also my note of June 3rd on this same problem. It deserves double mention! – Joseph O'Rourke Feb 18 '11 at 2:00

Well if we're going to give easy ones, then: checking if two real numbers are equal. As if you needed more reasons to be disturbed by the reals!

A special case of: checking if a vector $v$ in a finite dimensional vector space over the reals is linearly independent of a set of vectors $\{u_i\}$.

(almost equivalently: checking equality (in the sense of extensionality) of $k\geq 2$ bounded integer-valued functions. the output of such functions can be written as real numbers in $[0,1]$, but you have to have to pad each integer so that you don't accidentally call two different outputs the same real number (due to $0.99\ldots = 1.00$ etc). How to solve the halting problem: have a function $f(n) = 1$. Given some arbitrary program/function, nest it in a function $g(n)$ which runs it for $n$ cycles, and outputs $1$ if it halted, $0$ otherwise. $f$ and $g$ are equivalent iff the program does not halt.)

share|cite|improve this answer
Although there is a sense in which this problem is not decidable, I think it is not a "problem" in the sense of the question, in the sense of Turing computability, since it is not finitely encodable. Namely, a decidable problem is a set of natural numbers whose characteristic function is computable by a Turing machine. An undecidable problem is a set of natural numbers not computable in this way. Many mathematical objects, such as finitely presented groups, finite graphs, etc. can be finitely described, allowing Turing machines to accept such a description as input. – Joel David Hamkins Jan 13 '10 at 14:34
thanks for the explanation! – Matus Telgarsky Jan 14 '10 at 6:53
@Joel This still applies for computable reals. Computable reals are finitely encodable. – Dan Piponi Feb 19 '10 at 0:11
Michael, you are looking for the subject known as computable analysis: It is an elementary argument via the recursion theorem to show that equality of computable reals is not computable; indeed, you cannot even decide if a computable number is zero. (If you have an algorithm that does decide this correctly, then design a program $p$ that pretends to be zero until your algorithm says it is zero, and then after this $p$ should make the real non-zero, a contradiction.) – Joel David Hamkins May 29 '12 at 12:24
As Dan says, it applies to computable reals. And if you can't decide whether two computable reals are equal, then certainly you can't decide whether two arbitrary reals are equal! (This only to make the reals ‘disturbing’.) – Toby Bartels Jul 28 '12 at 23:41

My favourite is related to the Kolmogorov Complexity of a string:

The problem of deciding if a string $s$ is compressible ($K(s) <^? |s| $) is undecidable

share|cite|improve this answer

The following undecidable problem is natural for engineers in the sense that runtime estimation is an ubiquitous engineering problem associated to (for example) control theory and circuit design.

Viola's theorem  Given an integer $k$ and Turing machine $M$ promised to be in P, the question "Is the runtime of $M$ of ${O}(n^k)$ with respect to input length $n$ ?" is undecidable.

The proof of this problem's undecidability was given on TCS StackExchange by Emanuele Viola in answer to the question Are runtime bounds in P decidable?


This question arose in parsing Luca Tevisan's answer on TCS StackExchange to the question Do runtimes for P require EXP resources to upper-bound? … are concrete examples known? (answer: yes and yes).

The illumination sought in asking/answering this question was a better appreciation/intuition regarding the practical aspects of runtime estimation in the complexity class P, in the sense of runtime estimates that are feasible (that is, require computational resources in P), versus infeasible (that is, require computational resources in EXP), versus formally undecidable (the instance above).

What this problem's undecidability shows us, perhaps, is that some aspects of P are richer and more subtle than is readily appreciated upon first acquaintance.

share|cite|improve this answer

The recognition problem for compact, simply connected contact manifolds of given dimension $2n-1\geq 11$ (Seidel, 2007).

A contact structure on a $(2n-1)$-manifold is a tangent hyperplane field $\xi$ which can locally be written as $\ker\alpha$ for a 1-form $\alpha$ with $\alpha \wedge (d\alpha)^{n-1}$ non-vanishing. In principle there are finite ways to specify contact manifolds, using symplectic handlebody theory. But there's a simply connected contact manifold $(M_0,\xi_0)$ with the property that, given another, say $(M,\xi)$, the problem of deciding whether it's isomorphic to $(M_0,\xi_0)$ contains an algorithmically-unsolvable word problem for groups.

If you forget the contact structure, algorithmic recognition is possible (Nabutovsky-Weinberger).

share|cite|improve this answer

This I think is interesting: On a finite game board, but with an unbounded number of moves, games pitting teams against one another, in the presence of imperfect information, are undecidable. "Imperfect information" is like that in Bridge (although Bridge has a bounded number of moves). This result is proved in Games, Puzzles, & Computation by Robert Hearn and Erik Demaine, 2009.

share|cite|improve this answer

Above it was mentioned that, from a general finite group presentation, it is not decidable whether the group is finite. There are acutally a bunch of group properties that are similarly undecidable - is it abelian, solvable, simple? But my favourite would be : does it have more than one element!?

share|cite|improve this answer

My favorite example is the halting problem for Conway's "FRACTRAN" programming language: given a finite sequence of fractions q1, q2, ...., q_n, does the procedure "starting with a given integer and keep successively multiplying by the first element in the sequence which results in the product still being an integer until none of them do" halt? In fact there is specific sequence of fractions that is quite short which can be interpreted as a Universal machine.

share|cite|improve this answer

A variant of the "given a finite simplicial complex, is it the 5-sphere?" problem is the "given a finite simplicial complex, is it it a 6-manifold?".

I find this attractive because, because manifolds are such a basic and fundamental concept, you'd expect we'd be able to recognize one, but in fact we cannot.

This was pointed out by an answer to the question: When are (finite) simplicial complexes (smooth) manifolds?

share|cite|improve this answer

From what I've been told, it is impossible to decide whether (in general) a complex holomorphic function has a zero at the origin. Similarly, it is undecidable whether certain holomorphic functions have double zeros or zeros just "really" close to each other. [It would really be interesting if this had some effect on things like the Riemann hypothesis or BSD.]

share|cite|improve this answer
Statements like this do have an effect on the decidability of the Risch algorithm ( – Qiaochu Yuan Jan 12 '10 at 17:29
What data is given on the function? – Mariano Suárez-Alvarez Jan 12 '10 at 19:36
If you're given the Taylor expansion at the origin I'd hope it's decidable. :) – Ryan Budney Jan 12 '10 at 19:48
Re: Ryan -- As one can express real numbers such that there is no algorithm to determine if they are equal to zero, the answer is still no. [So, in some ways that makes my answer trivial, since then polynomials work. But see the other comment below.] Re: Mariano -- That's the big question! How much information can we give and still be unable to determine whether such a function has a zero? For a concrete example: Given the L-function associated to a rational elliptic curve of rank 4, can we algorithmically prove the analytic rank is 4? From what I understand this is still open! – Pace Nielsen Jan 19 '10 at 16:11
In Risch algorithm here is heuristic procedure needed in order to check if some algebraic form is equal to zero. This is because of The Theorem of Richardson which states what algebraic formulas are undecidable, see here – kakaz Feb 16 '10 at 12:19

Suppose we specify a group $G$ by a set of relations, e.g. $x_1x_2x_3^{-1} = 1$. Then, the problem of determining if $G$ is finite or not is undecidable.

share|cite|improve this answer
Thanks for this example. To supplement your description, the undecidable problem is: given a finite group presentation, determine if the group it presents is finite or infinite. – Joel David Hamkins Jul 2 '10 at 20:20

The rule 110 is also a cute one.

share|cite|improve this answer
As well as for its own sake, I find this one intensely interesting from the non-mathematical standpoint: it's simple enough that it is quite plausible that lone molecules / simple groups of such could be working as universal Turing machines. Even more plausible when you consider that there are many such rules that are Turing complete. Mind boggling implications for biology. – WetSavannaAnimal aka Rod Vance Jun 6 '11 at 4:27

A MODULAR SYSTEM $M$ is a finite set of "rules" of the form $ax+b\to cx+d$, with $a,b,c,d\in\mathbb{Z}$. If $u,v\in\mathbb{Z}$, then $u$ is "derivable" from $v$ in $M$ if one can get from $u$ to $v$ by applying rules in $M$. For example, the well-known Collatz problem asks whether for all positive integers $u$, 1 is derivable from $u$ in the modular system with the two rules $2x\to x, 2x+1\to 6x+4$.

The general problem of whether $u$ is derivable from $v$ in a given modular system $M$ is undecidable. (Proved in Borger, "Computability, Complexity and Logic").

share|cite|improve this answer

Let a finite structure be a finite underlying set A along with a finite set of finitary operation from A to itself. Such creatures are called algebras in the study of universal algebra, and one subarea of study is the equational theory of such a creature, i.e. the set of universally quantified equations which hold in the strucure (e.g. the associative law for semigroups).
The equational theory is said to be finitely based if there is a finite set of equations from which one can deduce precisely those equations in the equational theory.

A problem raised by Tarski and shown undecidable by McKenzie is Tarski's Finite Basis Problem: Given a finite structure , determine whether its equational theory is finitely based.

Gerhard "Ask Me About System Design" Paseman, 2010.01.12

share|cite|improve this answer

For completeness: Non trivial properties of languages are undecidable.

share|cite|improve this answer
Yes, they are undecidable from the programs that decide them. See Rice's Theorem:'s_theorem – Joel David Hamkins Jun 24 '10 at 18:35
Yes, this is Rice's theorem. I am stating it for completeness of the list: I don't see it listed. – SBH Jun 24 '10 at 19:08
I thank you for this example. – Joel David Hamkins Jul 3 '10 at 0:30

Not mentioned yet, that any computer language extended with non-deterministic features is also Turing computable.

This is interesting, because it allows the language to be simplified. If the programs operate on objects that are nil or a pair. Then you only need five instructions:

  • The constant nil
  • A pair operator
  • A sequence operator, that executes one code fragment after another
  • An inverse operator
  • A closure operator, which repeats a code fragment zero or multiple times

If you want to construct a piece code of that adds the two values of a pair, then first make something that construct (a - 1, b + 1) from (a, b). Then take the closure. This will generate (a - n, b + n). Finally, pick the value (0, c) and output c. This can be done by using the inverse operator on the pair and nil.

So, programming is a little bit odd, because you select the right value outside the loop (closure), rather than inside the loop, as in deterministic languages. The advantages is the much more simpler structure. No variables, no recursion, no matching operators (just use the inverse) and no control-structures, except closure.

This makes it a little bit between programming and mathematics. The simpler structure, allows easier mathematical reasoning. So, it might be an idea to convert a program in a deterministic language, to a program of a simplified non-deterministic language, before doing any mathematics on the program.


share|cite|improve this answer

In your last criterion, you are essentially asking for a "natural" problem that is nonrecursive, recursively enumerable, and is not complete for the recursively enumerable sets. Post proved the existence of such problems in Recursively enumerable sets of positive integers and their decision problems, for many-one reductions. Friedberg and Muchnik proved this also holds for Turing reductions, in separate papers Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944) and On the unsolvability of the problem of reducibility in the theory of algorithms. Whether these are "attractive" is probably determined by whether you like nonconstructive arguments. For a clear and self-contained exposition of these results, see Kozen's book Theory of Computation.

So this is only a partial answer, and it would still be nice to exhibit a real problem with intermediate degree.

Edit: in the survey Degrees of Unsolvability (which appears to be a chapter of an unpublished Volume 9 of the Handbook of the History of Logic), Ambos-Spies and Fejer state "it is fair to say that every particular c.e. set of natural numbers that has arisen from nonlogical considerations so far is either computable or complete... Thus one could say that the great complexity in the structure of the c.e. degrees arises solely from studying unnatural problems." This is quite a negative assessment! On a more positive note, Feferman showed in Degrees of Unsolvability Associated with Classes of Formalized Theories that every c.e. degree arises as the degree of some recursively axiomatizable consistent theory of first-order predicate calculus.

share|cite|improve this answer
Yes, to find what you call a real problem was my point. One can build intermediate degrees via priority argument constructions, and I like those argumens very much (and I do find them constructive), but to my knowledge there is no such intermediate degree arising outside such constructions. I would also recommend Soare's book on the Computably Enumerable Sets and Degrees. – Joel David Hamkins Jul 2 '10 at 20:13
I don't know if this counts, but "exotic" c.e. sets do arise in the results of Nabutovsky and Weinberger on Riemannian geometry. See Soare's exposition "Computability theory and differential geometry." – Timothy Chow Jul 4 '10 at 1:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.