Whenever I read about unsolvable computational problems, the example cited is Turing's Halting Problem. Are there any other instances of unsolvable computational problems?
Asked
Active
Viewed 87 times
1
-
2There is no algorithm to determine whether a diophantine equation has a solution. – Peter Oct 04 '21 at 14:37
-
2the word problem https://en.wikipedia.org/wiki/Word_problem_for_groups – Condo Oct 04 '21 at 14:41
-
2Post's correspondence problem, mortality problem with matrices are other examples. And not to forget , Conways game of life : There is no algorithm to determine whether some cell will live forever. – Peter Oct 04 '21 at 14:42
-
2See here for some discussion of unsolvable problems which are extremely different from the halting problem by way of being neither harder nor either in a precise sense (at a glance the examples given above are each equivalent to the halting problem in this sense). – Noah Schweber Oct 04 '21 at 14:51
-
Busy Beaver is another interesting example. – Momo Oct 04 '21 at 15:10
-
Crossposted at CSSE. – Noah Schweber Oct 05 '21 at 03:09