On Goedel Speed-Up and Succinctness of Language Representation
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.date.accessioned | 2007-04-23T16:43:26Z | |
| dc.date.available | 2007-04-23T16:43:26Z | |
| dc.date.issued | 1982-03 | en_US |
| dc.description.abstract | In this note we discuss the similarities and differences between Goedel's result about non-recursive shortening of proofs of formal systems by additional axioms and the corresponding results about the succinctness of different representations of languages. | en_US |
| dc.format.extent | 620814 bytes | |
| dc.format.extent | 147839 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-485 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6325 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On Goedel Speed-Up and Succinctness of Language Representation | en_US |
| dc.type | technical report | en_US |