Information System Theory Project Volume I Mem Theory A Mathematical Method For The Description And Analysis Of Discrete Finite Information Systems PDF Download

A discrete information system may be abstractly conceived as a domain of 'entities' characterized as to the following: an ensemble of possible states of mutual relation; a collection of possible 'local' transformations of system state; and 'coupling' possibilities which determine how the system may interact with 'environments.' As between several such systems, relations such as 'behavioral equivalence' and 'representation' may be defined. In respect to computer systems, the most diverse information processing and/or exhibiting 'devices, ' whether hard or soft or a combination of both, are to be amenable to mem-theoretic treatment. From the point of view of automata theory, mem-theory provides a method for constructing deterministic or non-deterministic finite state automata to explicate some informally-given interesting varieties of complex, discrete behavior. From such treatment, one is to obtain the capacity to describe, contrast and evaluate alternate organizational techniques and to be led to the invention of new ones. (Author).