On the Size of Programs in Subrecursive Formalisms
| dc.contributor.author | Constable, Robert L. | en_US |
| dc.date.accessioned | 2007-04-19T17:53:38Z | |
| dc.date.available | 2007-04-19T17:53:38Z | |
| dc.date.issued | 1970-03 | en_US |
| dc.description.abstract | This paper gives an overview of subrecursive hierarchy theory as it relates to computational complexity and applies some of the concepts to questions about the size of programs in subrecursive programming languages. The purpose is three-fold, to reveal in simple terms the workings of subrecursive hierarchies, to indicate new results in the area, and to point out ways that the fundamental ideas in hierarchy theory can lead to interesting questions about programming languages. A specific application yields new information about Blum's results on the size of programs and about the relationship between size and efficiency. | en_US |
| dc.format.extent | 959176 bytes | |
| dc.format.extent | 370637 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/TR70-58 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5917 | |
| 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 the Size of Programs in Subrecursive Formalisms | en_US |
| dc.type | technical report | en_US |