Timeline for Deciding Recursive/Recursively Enumerable when given Turning machine encoding as a language
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2013 at 8:56 | comment | added | Luke Mathieson | @ArjunJRao, good luck in your exam then! | |
| Jan 14, 2013 at 7:28 | comment | added | Arjun J Rao | No @LukeMathieson I did not have an assignment due. These are questions that I have sat on for some time now. My examination is approaching, so I put them all in one shot to the wrong site (unfortunately) | |
| Jan 10, 2013 at 3:58 | history | edited | Luke Mathieson | edited tags | |
| Jan 10, 2013 at 3:57 | comment | added | Luke Mathieson | I notice that you've posted several questions along the same lines in quick succession. Perhaps it would help your learning to wait a moment and see the answers you receive, as your questions are closely related. Or do you have an assignment due today? | |
| Jan 10, 2013 at 3:55 | answer | added | Luke Mathieson | timeline score: 3 | |
| Jan 10, 2013 at 3:40 | history | edited | Luke Mathieson | CC BY-SA 3.0 | Improved TeX, fixed some grammer, cleared the confusion between languages and string and made the list of options disjoint from each other |
| Jan 10, 2013 at 2:48 | history | migrated | from cstheory.stackexchange.com (revisions) | ||
| Jan 10, 2013 at 1:29 | history | asked | Arjun J Rao | CC BY-SA 3.0 |