Timeline for Are Turing machines more powerful than pushdown automata?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2014 at 12:16 | comment | added | Babbage's Difference Engine | Turing Machines describe recursively enumerable... Linear Bound Automata describe Context Sensitive Languages. | |
| Mar 23, 2012 at 15:58 | vote | accept | Gigili | ||
| Mar 22, 2012 at 21:32 | vote | accept | Gigili | ||
| Mar 22, 2012 at 21:32 | |||||
| Mar 22, 2012 at 20:02 | history | answered | Mike B. | CC BY-SA 3.0 |