JavaScript is disabled for your browser. Some features of this site may not work without it.
eCommons will be completely unavailable from 8am, Thursday Nov. 5, until 5pm, Friday Nov. 6 for server upgrades. Thank you for your patience during this planned service interruption.
Please contact us at ecommons-admin@cornell.edu if you have questions or concerns.
Please contact us at ecommons-admin@cornell.edu if you have questions or concerns.
Refinement of Hierarchies of Time Bounded Computations
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)$.
Date Issued
1968-06Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-20
Type
technical report