Timeline for Can a group be a universal Turing machine?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2012 at 0:24 | history | edited | Jason Rute | CC BY-SA 3.0 |
my italics didn't work
|
| Feb 14, 2012 at 0:21 | comment | added | Joel David Hamkins | I've modified my answer to handle the two-generator case, which of course requires a non-abelian group, but the basic idea is the same. | |
| Feb 13, 2012 at 21:30 | history | edited | Jason Rute | CC BY-SA 3.0 |
fixes grammer errors
|
| Feb 13, 2012 at 21:09 | history | edited | Jason Rute | CC BY-SA 3.0 |
Added update
|
| Feb 13, 2012 at 21:07 | comment | added | Joel David Hamkins | Yes, it does appear that we have the same answer, Jason. :-) | |
| Feb 13, 2012 at 21:05 | comment | added | Jason Rute | My answer at first glace looks similar to Joel's. (Beat by 38 secs! :) ) | |
| Feb 13, 2012 at 21:04 | history | answered | Jason Rute | CC BY-SA 3.0 |