Timeline for Verification of Turing-equivalent automata
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27, 2017 at 11:59 | vote | accept | Hauke Reddmann | ||
| Apr 26, 2017 at 19:27 | answer | added | Sylvain | timeline score: 1 | |
| Apr 26, 2017 at 19:10 | comment | added | Lucas K. | Note that there are famous mathematical problems that can be written as halting problem. Like Fermat's last theorem, four color theorem, golbach conjecture and probably much more. | |
| Apr 26, 2017 at 15:11 | answer | added | Joseph O'Rourke | timeline score: 7 | |
| S Apr 26, 2017 at 14:36 | history | edited | Lasse Rempe | CC BY-SA 3.0 |
Original edit fixed spelling and grammar; I reverted the change of "behaviour" to "behavior" as I don't think it is necessary to change British to American spelling.
|
| S Apr 26, 2017 at 14:36 | history | suggested | Christian Gaetz | CC BY-SA 3.0 |
Fixed spelling and grammar
|
| Apr 26, 2017 at 14:32 | review | Suggested edits | |||
| S Apr 26, 2017 at 14:36 | |||||
| Apr 26, 2017 at 14:22 | history | asked | Hauke Reddmann | CC BY-SA 3.0 |