Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.date.accessioned2007-04-19T19:03:34Z
dc.date.available2007-04-19T19:03:34Z
dc.date.issued1973-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-175en_US
dc.identifier.urihttps://hdl.handle.net/1813/6018
dc.description.abstractTo develop an abstract theory which deals with the quantitative aspects of computing we need a deeper understanding of how to define "natural" computational complexity measures axiomatically. To this end, this paper summarizess the principal properties which hold for some natural complexity measures but not for all measures and which have been proposed as desirable properties of natural measuress. The paper discusses the nature of these properties, studies their interrelations and their possible values towards defining natural computational complexity measures. A number off open problems are discussed and directions for further research are suggested.en_US
dc.format.extent1362198 bytes
dc.format.extent357312 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn the Problem of Finding Natural Computational Complexity Measuresen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics