{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:05Z","timestamp":1750220525160,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T00:00:00Z","timestamp":1619395200000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:p>Seeking to rectify the two mutually exclusive ways of comparing computational power---encoding and simulation.<\/jats:p>","DOI":"10.1145\/3431281","type":"journal-article","created":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T14:14:22Z","timestamp":1619446462000},"page":"37-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Let's be honest"],"prefix":"10.1145","volume":"64","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[{"name":"Tel Aviv University, Ramat Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,4,26]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Introduction to Theoretical Computer Science","author":"Barak B.","year":"2020","unstructured":"Barak , B. Introduction to Theoretical Computer Science . 2020 . Online text (version of Dec . 25, 2020); https:\/\/bit.ly\/3bZnLVi Barak, B. Introduction to Theoretical Computer Science. 2020. Online text (version of Dec. 25, 2020); https:\/\/bit.ly\/3bZnLVi"},{"key":"e_1_2_1_2_1","volume-title":"Ob odnom klasse machin turinga (machiny minskogo) [On one class of Turing machines (Minsky machines)]. Algebra i Logika [Algebra and Logic] 1, 6","author":"Barzdins J.I.","year":"1963","unstructured":"Barzdins , J.I. Ob odnom klasse machin turinga (machiny minskogo) [On one class of Turing machines (Minsky machines)]. Algebra i Logika [Algebra and Logic] 1, 6 ( 1963 ), 42--51. In Russian . Barzdins, J.I. Ob odnom klasse machin turinga (machiny minskogo) [On one class of Turing machines (Minsky machines)]. Algebra i Logika [Algebra and Logic] 1, 6 (1963), 42--51. In Russian."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzl003"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78127-1_12"},{"key":"e_1_2_1_5_1","series-title":"Outstanding Contributions to Logic Series","volume-title":"Martin Davis on Computability, Computational Logic & Mathematical Foundations","author":"Boker U.","year":"2017","unstructured":"Boker , U. and Dershowitz , N . Honest computability and complexity . In E. Omodeo and A. Policriti, Eds., Martin Davis on Computability, Computational Logic & Mathematical Foundations , volume 10 of Outstanding Contributions to Logic Series , Springer , Cham, Switzerland , 2017 , 153--175; https:\/\/bit.ly\/3cH8589 Boker, U. and Dershowitz, N. Honest computability and complexity. In E. Omodeo and A. Policriti, Eds., Martin Davis on Computability, Computational Logic & Mathematical Foundations, volume 10 of Outstanding Contributions to Logic Series, Springer, Cham, Switzerland, 2017, 153--175; https:\/\/bit.ly\/3cH8589"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139164931"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500890"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/acref\/9780199688975.001.0001"},{"key":"e_1_2_1_9_1","volume-title":"World Scientific","author":"D'Souza D.","year":"2011","unstructured":"D'Souza , D. and Shankar , P . Modern Applications of Automata Theory . World Scientific , River Edge, NJ , 2011 . D'Souza, D. and Shankar, P. Modern Applications of Automata Theory. World Scientific, River Edge, NJ, 2011."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.56"},{"key":"e_1_2_1_11_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"Garey , M.R. and Johnson , D.S . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman , New York, NY , 1979 . Garey, M.R. and Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, NY, 1979."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/557365"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1454320"},{"key":"e_1_2_1_14_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J.E.","year":"1979","unstructured":"Hopcroft , J.E. and Ullman , J.D . Introduction to Automata Theory, Languages, and Computation . Addison-Wesley , Reading, MA , 1979 . Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90028-R"},{"key":"e_1_2_1_16_1","volume-title":"Minsky the theorist. (Jan. 27","author":"Lipton R.J.","year":"2016","unstructured":"Lipton , R.J. and Regan , K.W . Minsky the theorist. (Jan. 27 , 2016 ); https:\/\/bit.ly\/2P45zRn Lipton, R.J. and Regan, K.W. Minsky the theorist. (Jan. 27, 2016); https:\/\/bit.ly\/2P45zRn"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00485427"},{"key":"e_1_2_1_19_1","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers Jr., H.","year":"1966","unstructured":"Rogers , Jr., H. Theory of Recursive Functions and Effective Computability . McGraw-Hill , New York, NY , 1966 . Rogers, Jr., H. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, NY, 1966."},{"key":"e_1_2_1_20_1","volume-title":"A two counter machine cannot calculate 2N. Technical report","author":"Schroeppel R.","year":"1972","unstructured":"Schroeppel , R. A two counter machine cannot calculate 2N. Technical report , Massachusetts Institute of Technology , Artificial Intelligence Laboratory, Cambridge, MA, 1972 ; ftp:\/\/publications.ai.mit.edu\/ai-publications\/pdf\/AIM-257.pdf Schroeppel, R. A two counter machine cannot calculate 2N. Technical report, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, Cambridge, MA, 1972; ftp:\/\/publications.ai.mit.edu\/ai-publications\/pdf\/AIM-257.pdf"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883561"},{"key":"e_1_2_1_22_1","volume-title":"Introduction to the Theory of Computation","author":"Sipser M.","year":"2006","unstructured":"Sipser , M. Introduction to the Theory of Computation . Thomson , Boston, MA , 2 nd edition, 2006 . Sipser, M. Introduction to the Theory of Computation. Thomson, Boston, MA, 2nd edition, 2006.","edition":"2"},{"key":"e_1_2_1_23_1","volume-title":"Machines, Effectiveness and Feasibility","author":"Sommerhalder R.","year":"1988","unstructured":"Sommerhalder , R. and van Westrhenen , S.C. The Theory of Computability: Programs , Machines, Effectiveness and Feasibility . Addison-Wesley, Workingham , England , 1988 . Sommerhalder, R. and van Westrhenen, S.C. The Theory of Computability: Programs, Machines, Effectiveness and Feasibility. Addison-Wesley, Workingham, England, 1988."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268280"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431281","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3431281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:46Z","timestamp":1750195486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,26]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["10.1145\/3431281"],"URL":"https:\/\/doi.org\/10.1145\/3431281","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2021,4,26]]},"assertion":[{"value":"2021-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}