Refinement of Hierarchies of Time Bounded Computations

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/5873
Collections
Metadata
Show full item record
Author
Hartmanis, Juris; Hopcroft, John E.
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-06
Publisher
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

Statistics