A “universal” automaton is a finite system which given an arbitrary logical proposition in form of (a linear set L) tape attached to it, at say specified points, will produce the true or false answer. (Universal ought to have relative sense: with reference to a class of problems it can decide.) The “arbitrary” means really in a class of propositions like Turing’s—or smaller or bigger.
