Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/5873
 Title: Refinement of Hierarchies of Time Bounded Computations Authors: Hartmanis, JurisHopcroft, John E. Keywords: computer sciencetechnical report Issue Date: Jun-1968 Publisher: Cornell University Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-20 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)$. URI: http://hdl.handle.net/1813/5873 Appears in Collections: Computer Science Technical ReportsHartmanis, Juris

Files in This Item:

File Description SizeFormat