Timeline for What are the most attractive Turing undecidable problems in mathematics?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Sep 12, 2016 at 3:47 | history | edited | Tadashi | CC BY-SA 3.0 |
Added hyperlink to answer
|
| Sep 10, 2016 at 20:09 | comment | added | Igor Potapov | I added some comments to the post about the importance of the complexity/decidability status for matrix problems. | |
| Sep 10, 2016 at 20:08 | history | edited | Igor Potapov | CC BY-SA 3.0 |
added 1866 characters in body
|
| Sep 10, 2016 at 17:43 | review | Late answers | |||
| Sep 10, 2016 at 19:26 | |||||
| Sep 10, 2016 at 17:39 | comment | added | wonderich | The audience will appreciate more if you can comment on the meaning of the decidability/undecidability of matrices, and why they are important and deep to choose as the most attractive Turing undecidable problems. | |
| Sep 10, 2016 at 17:28 | review | First posts | |||
| Sep 10, 2016 at 17:39 | |||||
| S Sep 10, 2016 at 17:28 | history | answered | Igor Potapov | CC BY-SA 3.0 | |
| S Sep 10, 2016 at 17:28 | history | made wiki | Post Made Community Wiki by Igor Potapov |