| { |
| "paper_id": "J85-4003", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T02:16:25.273943Z" |
| }, |
| "title": "THE CONCEPT OF SUPERAUTOMATON", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "J" |
| ], |
| "last": "Nelson", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Western Reserve University Cleveland", |
| "location": { |
| "postCode": "44106", |
| "region": "OH" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "A recent review of my book The Logic of Mind in this journal refers to the key idea of the book, that of a superautomaton, as a \"Moore machine\". However, none of the central arguments of the book go through for Moore Machines. This note presents a sketch of the correct construction.", |
| "pdf_parse": { |
| "paper_id": "J85-4003", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "A recent review of my book The Logic of Mind in this journal refers to the key idea of the book, that of a superautomaton, as a \"Moore machine\". However, none of the central arguments of the book go through for Moore Machines. This note presents a sketch of the correct construction.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "In his review of The Logic of Mind (Nelson 1982) in this journal (Vol. 11, no. 1) , David Israel correctly identifies the idea of superautomaton as the key theoretical tool I use in attempting to explicate intentional terms of psychology such as take, expectation, and belief. However, his characterization of a superautomaton as a variety of Moore machine (Moore 1956 ) is very misleading. Inasmuch as the concept is central to the main argument of the book, I would like to describe it here in enough detail to cover the idea I really intended.", |
| "cite_spans": [ |
| { |
| "start": 35, |
| "end": 48, |
| "text": "(Nelson 1982)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 65, |
| "end": 74, |
| "text": "(Vol. 11,", |
| "ref_id": null |
| }, |
| { |
| "start": 75, |
| "end": 81, |
| "text": "no. 1)", |
| "ref_id": null |
| }, |
| { |
| "start": 357, |
| "end": 368, |
| "text": "(Moore 1956", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "I specify, but do not offer a design or model of, an executive Turing machine T p that (a) comprehends a finite number of finite automata connected in parallel, which it monitors; (b) has access to a stored encoded table representing the transition functions of each component automaton T; (c) includes means for deciding whether a given state of a component automaton can reach a final state.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "This complex device T t is a \"superautomaton\".", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The way it works is this. If an input string x to a component automaton T includes undefined (vague, degraded, or unclear) symbols u, then when T reach u it ceases processing. T r decides whether there is a string y that could drive T to a final state. If not, it rejects x as not acceptable to T. If there is a string, T' consults the table of T and determines by random choice a symbol s defined for T that drives T to a state for which there is a string leading to a final state.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Then the undefined symbol u is taken to be s, and the computation of the string x continues.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Given the indicated resources T r can take ill-defined, fuzzy input to be such as to satisfy expectations of the system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "\"Expectation\" as well as other intentional concepts at the perceptual level are all analyzable in terms of ordinary logic operations, the indicated construction of T', and standard mathematical machine theory.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "(c) is equivalent to means for solving the halting problem; this entails that the component automata (which could be as complex as pushdown automata) must be less than full Turing machines, for which the halting problem is recursively unsolvable. It also entails that the executive part of T' must be, in terms of competence, a twoway tape Turing machine, not a Moore machine. (In terms of performance, of course, one would be limited in the real world to Turing machines that are approximated by brains or digital computers, i.e., by finite sequential machines; but this is of little theoretical moment.)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Beyond the specification (a)-(c) and a program-like description of the function of T' (Nelson 1976 ), I do not pretend to know what T p would look like. By the recursion theorem of mathematical logic (Rogers 1967) , some such thing must exist -i.e., there are self-describing Turing machines. There are also concrete analogous instances, i.e., generic codes.", |
| "cite_spans": [ |
| { |
| "start": 86, |
| "end": 98, |
| "text": "(Nelson 1976", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 200, |
| "end": 213, |
| "text": "(Rogers 1967)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "I think this kind of idea is significantly relevant to computational theory and cognitive science, not just to the concerns of my book (which is meant to be a philosophical argument for the plausibility of computationalist theories of mind and cognition), but also to the very pervasive current employment of self-reference in cognitive science and artificial intelligence. My version, of course, is not strictly new as it is an adaptation of the insights of others (Lee 1963 , von Neumann 1966 , all of which stem from Goedel's work (1931) on the incompleteness of arithmetic.", |
| "cite_spans": [ |
| { |
| "start": 466, |
| "end": 475, |
| "text": "(Lee 1963", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 476, |
| "end": 494, |
| "text": ", von Neumann 1966", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 520, |
| "end": 540, |
| "text": "Goedel's work (1931)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Uber Formal Unentscheidbare Satze der Prineipia Mathematica und Verwandter Systeme I. Monatsheft fur Mathematik und", |
| "authors": [ |
| { |
| "first": "Kurt", |
| "middle": [], |
| "last": "Goedel", |
| "suffix": "" |
| } |
| ], |
| "year": 1931, |
| "venue": "Physik", |
| "volume": "38", |
| "issue": "", |
| "pages": "173--198", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Goedel, Kurt 1931 Uber Formal Unentscheidbare Satze der Prineipia Mathematica und Verwandter Systeme I. Monatsheft fur Mathema- tik und Physik 38: 173-198.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "A Turing Machine which Prints its own Code Script", |
| "authors": [ |
| { |
| "first": "C", |
| "middle": [ |
| "Y" |
| ], |
| "last": "Lee", |
| "suffix": "" |
| } |
| ], |
| "year": 1963, |
| "venue": "Proceedings of the Symposium on Mathematical Theory of Automata", |
| "volume": "", |
| "issue": "", |
| "pages": "155--164", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Lee, C.Y. 1963 A Turing Machine which Prints its own Code Script. In Fox, Jerome, Ed., Proceedings of the Symposium on Mathematical Theory of Automata. Brooklyn Polytechnic Press, Brooklyn, New York: 155-164.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Gedanken Experiments on Sequential Machines", |
| "authors": [ |
| { |
| "first": "E", |
| "middle": [ |
| "F" |
| ], |
| "last": "Moore", |
| "suffix": "" |
| } |
| ], |
| "year": 1956, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "129--153", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Moore, E.F. 1956 Gedanken Experiments on Sequential Machines. In Shannon, Claude E. and McCarthy, John, Eds., Automata Studies. Princeton Press, Princeton, New Jersey: 129-153.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "On Mechanical Recognition", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "J" |
| ], |
| "last": "Nelson", |
| "suffix": "" |
| } |
| ], |
| "year": 1976, |
| "venue": "Philosophy of Science", |
| "volume": "43", |
| "issue": "1", |
| "pages": "24--52", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nelson, R.J. 1976 On Mechanical Recognition. Philosophy of Science 43(1): 24-52.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "The Logic of Mind. D", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "J" |
| ], |
| "last": "Nelson", |
| "suffix": "" |
| } |
| ], |
| "year": 1982, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nelson, R.J. 1982 The Logic of Mind. D. Reidel Publishing Co., Dordrecht, Holland.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Theory of Recursive Functions and Effective Computability", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Rogers", |
| "suffix": "" |
| } |
| ], |
| "year": 1967, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Rogers, H. Jr. 1967 Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York, New York.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Theory of Self-Reproducing Automata", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Von Neumann", |
| "suffix": "" |
| } |
| ], |
| "year": 1966, |
| "venue": "Computational Linguistics", |
| "volume": "11", |
| "issue": "4", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "von Neumann, J. 1966 Theory of Self-Reproducing Automata. (Burks, Arthurs W., Ed,) University of Illinois Press, Urbana, Illinois. Computational Linguistics, Volume 11, Number 4, October-December 1985", |
| "links": null |
| } |
| }, |
| "ref_entries": {} |
| } |
| } |
