Refinement of Hierarchies of Time Bounded Computations
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.contributor.author | Hopcroft, John E. | en_US |
| dc.date.accessioned | 2007-04-09T21:01:57Z | |
| dc.date.available | 2007-04-09T21:01:57Z | |
| dc.date.issued | 1968-06 | en_US |
| dc.description.abstract | It is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$ and cannot be performed by any multitape Turing machine in time $T(n)$. | en_US |
| dc.format.extent | 247901 bytes | |
| dc.format.extent | 143868 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-20 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5873 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Refinement of Hierarchies of Time Bounded Computations | en_US |
| dc.type | technical report | en_US |