|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Time constructible definition?''
by acone on 2005-04-27 01:38:14 |
|
| What do you mean "there exists a turing machine that halts after using exactly f(n) cells?" For any value of f(n), I can construct a turing machine that halts after f(n) steps.
Did you mean halts after f(n) steps on input n? Or something like this? |
| | [ reply | up ] | |
|
|
|
|
|
|
|
