Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.date.accessioned2007-04-23T17:41:17Z
dc.date.available2007-04-23T17:41:17Z
dc.date.issued1989-01en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-961en_US
dc.identifier.urihttps://hdl.handle.net/1813/6877
dc.description.abstractIn this column, we show how a variety of interesting results in theory of computation all follow from a simple observation about $\prod _{2}$-complete sets of total machines. We easily derive: a) representation independent independence results, b) non-recursive succinctness relations between different representations of languages, c) the existence of incomplete languages in various complexity classes.en_US
dc.format.extent865094 bytes
dc.format.extent253575 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 Importance of Being II2-Harden_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics