{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215851,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["XRDS"],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p>Our culture is in the process of renegotiating what it thinks computation and computer really mean.<\/jats:p>","DOI":"10.1145\/2090276.2090283","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T21:21:57Z","timestamp":1347484917000},"page":"8-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["What is computation?"],"prefix":"10.1145","volume":"18","author":[{"given":"Ian","family":"Horswill","sequence":"first","affiliation":[{"name":"Northwestern University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"42","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"2","author":"Turing A","year":"1936","journal-title":"Proceedings of the London Mathematical Society, Series"},{"key":"e_1_2_1_2_1","unstructured":"Minsky and Blum proved in the 1960s that a \"two-counter machine\" was Turing complete. A two-counter machine is a machine whose only data representation is a pair of numbers (non-negative integers in fact) and whose only commands are to add or subtract 1 from one of the numbers and to check whether one of them was zero.  Minsky and Blum proved in the 1960s that a \"two-counter machine\" was Turing complete. A two-counter machine is a machine whose only data representation is a pair of numbers (non-negative integers in fact) and whose only commands are to add or subtract 1 from one of the numbers and to check whether one of them was zero."},{"key":"e_1_2_1_3_1","unstructured":"Turing A. Computing machinery and intelligence. Originally published by Oxford University Press on behalf of MIND (the Journal of the Mind Association) 59 236 (1959) 433--60; http:\/\/www.abelard.org\/turpap\/turpap.htm  Turing A. Computing machinery and intelligence. Originally published by Oxford University Press on behalf of MIND (the Journal of the Mind Association) 59 236 (1959) 433--60; http:\/\/www.abelard.org\/turpap\/turpap.htm"},{"key":"e_1_2_1_4_1","first-page":"3","article-title":"the computational view is not universally accepted. See for example, Searle, J. R. Minds, brains, and programs","volume":"3","author":"Although","year":"1980","journal-title":"Behavioral and Brain Sciences"}],"container-title":["XRDS: Crossroads, The ACM Magazine for Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090276.2090283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090276.2090283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090276.2090283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1145\/2090276.2090283"],"URL":"https:\/\/doi.org\/10.1145\/2090276.2090283","relation":{},"ISSN":["1528-4972","1528-4980"],"issn-type":[{"type":"print","value":"1528-4972"},{"type":"electronic","value":"1528-4980"}],"subject":[],"published":{"date-parts":[[2012,3]]},"assertion":[{"value":"2012-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}