{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:52:31Z","timestamp":1649199151988},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1961,10]]},"abstract":"\n This paper\n 1<\/jats:sup>\n compares the notions of Turing machine, finite automaton and neural net. A new notation is introduced to replace net diagrams. \u201cEquivalence\u201d theorems are proved for nets with receptors, and finite automata; and for nets with receptors and effectors, and Turing machines. These theorems are discussed in relation to papers of Copi, Elgot and Wright; Rabin and Scott; and McCulloch and Pitts. It is shown that sets of positive integers \u201caccepted\u201d by finite automata are recursive; and a strengthened form of a theorem of Kleene is proved.\n <\/jats:p>","DOI":"10.1145\/321088.321089","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:13Z","timestamp":1027769173000},"page":"467-475","source":"Crossref","is-referenced-by-count":10,"title":["Turing Machines, Finite Automata and Neural Nets"],"prefix":"10.1145","volume":"8","author":[{"given":"Michael","family":"Arbib","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, Mass and Sydney, Australia"}]}],"member":"320","reference":[{"issue":"10","key":"e_1_2_1_1_2","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/JRPROC.1953.274312","article-title":"Theory of logical nets","volume":"41","author":"BUHKS A. W.","year":"1953","journal-title":"Proc. IRE"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/320924.320931"},{"key":"e_1_2_1_3_2","unstructured":"DAVlS MARTIN Computability and Unsolvab 12ty. McGraw-Hill New York 1958. DAVlS MARTIN Computability and Unsolvab 12ty. McGraw-Hill New York 1958."},{"key":"e_1_2_1_4_2","first-page":"341","volume-title":"Automata gtudies, ed by C. E. Shannon and J. McCarthy","author":"KLEENE S.C.","year":"1956"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"5","author":"CULIOCH W. S.","year":"1943","journal-title":"Bull. Math. Bwphys"},{"key":"e_1_2_1_6_2","first-page":"114","article-title":"Finite automata and thcir decision problems IBM J","volume":"8","author":"RABIN M. O.","year":"1959","journal-title":"Res. Dev."},{"key":"e_1_2_1_7_2","first-page":"230","article-title":"On computable numbers, with an application to bile Entscheidungsproblem","volume":"42","author":"TURING A. M","year":"1936","journal-title":"Proc. London Math. Soc. (2)"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/321088.321089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T21:55:49Z","timestamp":1614722149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/321088.321089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1961,10]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1961,10]]}},"alternative-id":["10.1145\/321088.321089"],"URL":"http:\/\/dx.doi.org\/10.1145\/321088.321089","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"published":{"date-parts":[[1961,10]]}}}