Timeline for Machines whose languages are their own encoding
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2015 at 7:05 | history | tweeted | twitter.com/StackCompSci/status/677384051448225792 | ||
| Dec 17, 2015 at 5:41 | vote | accept | Yuanchu Dang | ||
| Dec 16, 2015 at 23:38 | history | edited | David Richerby | CC BY-SA 3.0 |
formatting
|
| Dec 16, 2015 at 21:13 | answer | added | Yuval Filmus | timeline score: 4 | |
| Dec 16, 2015 at 20:55 | history | edited | Yuanchu Dang |
edited tags
|
|
| Dec 16, 2015 at 20:51 | comment | added | chi | I'd try a few attempts exploiting the s-m-n theorem and the 2nd recursion theorem to build quine-like TMs. It might lead to a useful m-reduction. (Why is this marked complexity-theory ?) | |
| Dec 16, 2015 at 20:17 | history | edited | Yuanchu Dang | CC BY-SA 3.0 |
added 24 characters in body
|
| Dec 16, 2015 at 19:34 | review | First posts | |||
| Dec 16, 2015 at 22:52 | |||||
| Dec 16, 2015 at 19:28 | history | asked | Yuanchu Dang | CC BY-SA 3.0 |