Timeline for Does hyper-computational power of infinite time Turing machines also require infinite memory?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 1, 2014 at 6:56 | history | tweeted | twitter.com/#!/StackCSTheory/status/495100640780353536 | ||
| Jul 18, 2014 at 6:24 | answer | added | Andrej Bauer | timeline score: 4 | |
| Jul 17, 2014 at 6:23 | comment | added | Kaveh | Then @Peter's comment answers your question. I this is more suitable for Computer Science, it is an undergraduate exercise to show that $space \leq time \leq 2^{O(space)}$. | |
| Jul 17, 2014 at 6:20 | history | edited | Kaveh | CC BY-SA 3.0 |
deleted 419 characters in body; edited tags; edited title
|
| Jul 17, 2014 at 3:08 | comment | added | Inducto | I would say infinite-time Turing machine. I was not originally limiting to infinite-time Turing machine, though. | |
| Jul 16, 2014 at 19:59 | comment | added | Kaveh | The question is not clear. Space and time may not be defined or even make sense in some models. Which hypercomputation model are you talking about? | |
| Jul 16, 2014 at 16:14 | comment | added | Peter Shor | Since space $S$ machines need never use more than exponential time (that's how many states they have), in order to do infinite-time computation you need infinite-space as well. | |
| Jul 16, 2014 at 15:36 | review | Close votes | |||
| Jul 24, 2014 at 3:01 | |||||
| Jul 16, 2014 at 14:36 | review | First posts | |||
| Jul 16, 2014 at 14:45 | |||||
| Jul 16, 2014 at 14:34 | history | asked | Inducto | CC BY-SA 3.0 |