Quote: a complete realization defines a transition function and constants; can realize a complete language

Note

complete realization R is (E, C, .tau.) where C.subset.E and .tau.: E->E (transition function) and C are the fixed points. ... a complete realization strictly realized a complete language if its semantic function are converging sequences of R's transition function (paraphrased)

Related Topics

Topic: reduction machines (14 items)