Timeline for Definition of a monotone machine.
Current License: CC BY-SA 2.5
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 2, 2010 at 2:10 | history | edited | Kaveh |
edited tags
|
|
Nov 1, 2010 at 18:36 | answer | added | Bjørn Kjos-Hanssen | timeline score: 3 | |
Oct 1, 2010 at 4:39 | comment | added | Kurt | I'm sure anyone responding to this question will recognize this, but to clarify things for the casual viewer, it is not the lexicographic ordering that is being referred to but rather a prefix ordering: $x \preceq y$ iff $x$ is an initial segment of $y$. EDIT: After rereading Li & Vitanyi's monotone machine definition (I'm looking at the 2nd edition), it seems like they misspoke and described a prefix machine instead of a monotone machine. I suspect they mean to say that M(x) = y if y is what has been output just before the next input tape symbol is read. | |
Sep 30, 2010 at 10:10 | history | edited | Sadeq Dousti | CC BY-SA 2.5 |
added 32 characters in body
|
Sep 30, 2010 at 10:04 | history | edited | Sadeq Dousti | CC BY-SA 2.5 |
added 48 characters in body; added 68 characters in body
|
Sep 30, 2010 at 9:41 | history | edited | aurevoirlesenfants | CC BY-SA 2.5 |
added 796 characters in body
|
Sep 29, 2010 at 19:43 | history | asked | aurevoirlesenfants | CC BY-SA 2.5 |