Show simple item record

Comparative Schematology

dc.date.accessioned2004-10-01T20:49:34Z
dc.date.accessioned2018-11-24T10:10:51Z
dc.date.available2004-10-01T20:49:34Z
dc.date.available2018-11-24T10:10:51Z
dc.date.issued1970-11-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5851
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/5851
dc.description.abstractWhile we may have the intuitive idea of one programming language having greater power than another, or of some subset of a language being an adequate 'core' for that language, we find when we try to formalize this notion that there is a serious theoretical difficulty. This lies in the fact that even quite rudimentary languages are nevertheless 'universal' in the following sense. If the language allows us to program with simple arithmetic or list-processing functions then any effective control structure can be simulated, traditionally by encoding a Turing machine computation in some way. In particular, a simple language with some basic arithmetic can express programs for any partial recursive function. Such an encoding is usually quite unnatural and impossibly inefficient. Thus, in order to carry on a practical study of the comparative power of different languages we are led to banish explicit functions and deal instead with abstract, uninterpreted programs or schemas. What follows is a brief report on some preliminary exploration in this area.en_US
dc.format.extent18 p.en_US
dc.format.extent899352 bytes
dc.format.extent703403 bytes
dc.language.isoen_US
dc.titleComparative Schematologyen_US


Files in this item

FilesSizeFormatView
AIM-201.pdf703.4Kbapplication/pdfView/Open
AIM-201.ps899.3Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record