Timeline for Is the language TMs that accept finite languages Turing-recognizable?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Nov 2, 2015 at 22:13 | vote | accept | advocateofnone | ||
| Nov 2, 2015 at 19:53 | answer | added | Raphael | timeline score: 7 | |
| Nov 2, 2015 at 19:46 | comment | added | Raphael | Buzzword: extended Rice's theorem. | |
| Nov 2, 2015 at 19:42 | history | edited | Raphael | CC BY-SA 3.0 |
added 27 characters in body; edited tags; edited title
|
| Nov 2, 2015 at 19:33 | answer | added | templatetypedef | timeline score: 4 | |
| Nov 2, 2015 at 19:19 | review | Close votes | |||
| Nov 7, 2015 at 3:01 | |||||
| Nov 2, 2015 at 19:07 | history | edited | advocateofnone | CC BY-SA 3.0 |
deleted 3 characters in body; edited title
|
| Nov 2, 2015 at 18:30 | history | asked | advocateofnone | CC BY-SA 3.0 |