Timeline for Can a group be a universal Turing machine?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 15, 2012 at 10:31 | comment | added | HJRW | I've added something - hope it helps. I think this is the sort of thing that Boone was talking about when he apparently said that much of combinatorial group theory consists of 'cheap tricks and bad jokes'. | |
| Feb 15, 2012 at 10:29 | history | edited | HJRW | CC BY-SA 3.0 |
Added description of embedding.
|
| Feb 14, 2012 at 12:30 | comment | added | Joel David Hamkins | Great! Could you explain a bit more about why the embedding $G_0\to G_1$ is computable? | |
| Feb 14, 2012 at 10:01 | history | answered | HJRW | CC BY-SA 3.0 |