Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 26, 2020 at 14:40 | comment | added | Ciro Santilli OurBigBook.com | @Christoph-SimonSenjak cs.stackexchange.com/questions/26340/… | |
| Feb 18, 2020 at 14:13 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question has been bumped anyway)
|
| Mar 8, 2016 at 23:16 | comment | added | Andrew | @Christoph-SimonSenjak scottaaronson.com/democritus/lec4.html | |
| Aug 26, 2014 at 9:53 | comment | added | Joel David Hamkins | @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 en.wikipedia.org/wiki/…. | |
| Aug 26, 2014 at 9:49 | comment | added | Christoph-Simon Senjak | 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? | |
| Jan 13, 2010 at 13:15 | history | answered | Joel David Hamkins | CC BY-SA 2.5 |