Accession Number : AD0680782

Title :   ABSTRACT FAMILIES OF PROCESSORS,

Corporate Author : SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s) : Rose,Gene F.

Report Date : 13 MAY 1968

Pagination or Media Count : 55

Abstract : A 'processor' is a Turing-like automaton with auxiliary storage. An 'abstract family' of processors (AFP) consists of all processors that use the storage in the same way. Properties common to all AFP are derived. For a family of operations to be the output functions of some AFP, it is necessary and sufficient that certain word-sets representing its members form a full AFL (i.e. abstract family of languages in the sense of Ginsburg and Greibach) closed under intersection and iterated finite substitution. For a family of word-sets to be the accepted languages of some AFP, it is necessary and sufficient that it be a full AFL closed under interaction and iterated finite substitution. The smallest full AFL of this kind is the family of all recursively enumerable sets. (Author)

Descriptors :   (*DIGITAL COMPUTERS, THEORY), PROGRAMMING LANGUAGES, MEMORY DEVICES, AUTOMATA, ITERATIONS, THEOREMS

Subject Categories : Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE