eCommons

 

Refinement of Hierarchies of Time Bounded Computations

Other Titles

Abstract

It is shown that for any "slowly growing" time function T(n) and any ϵ>0 there exists a computation which can be performed by a multitape Turing machine in time T(n)logϵT(n) and cannot be performed by any multitape Turing machine in time T(n).

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1968-06

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR68-20

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record