SYNTACTIC SIMPLIFICATION,
Abstract
The problem of syntactic complexity is investigated under the assumption that the complexity function is recursive (or at least partial recursive); this is surely the weakest restriction under which results of any significance may be expected. Various restrictions are imposed, also, upon the minimization procedures considered; these restrictions are at first quite strong and are then gradually weakened. The results are, for the most part, negative; it is proved that the possibilities of effective ''simplification'', in the above sense, are limited in the extreme. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1963
- Accession Number
- AD0419732
Entities
People
- A. Kasher
- D. Louvish
Organizations
- Hebrew University of Jerusalem