{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T01:45:58Z","timestamp":1792547158743,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,2,22]]},"DOI":"10.1145\/3478431.3499309","type":"proceedings-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:53:28Z","timestamp":1645577608000},"page":"675-681","source":"Crossref","is-referenced-by-count":7,"title":["Teach More, Not Less Computability Theory in CS202X"],"prefix":"10.1145","author":[{"given":"Richard","family":"Blumenthal","sequence":"first","affiliation":[{"name":"Regis University, Denver, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Retrieved","author":"CAC.","year":"2016","unstructured":"ABET- CAC. 2016 . Proposed CAC criteria changes overview . Retrieved November 13, 2021 from https:\/\/www.abet.org\/wp-content\/uploads\/2016\/12\/ProposedCAC-Criteria-Motivation-and-Changes.pdf. ABET-CAC. 2016. Proposed CAC criteria changes overview. Retrieved November 13, 2021 from https:\/\/www.abet.org\/wp-content\/uploads\/2016\/12\/ProposedCAC-Criteria-Motivation-and-Changes.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Criteria for Accrediting Computing Programs 2021--2022. Retrieved","author":"ABET-CAC.","year":"2021","unstructured":"ABET-CAC. 2021. Criteria for Accrediting Computing Programs 2021--2022. Retrieved November 7, 2021 from http:\/\/ccrma.stanford.edu\/~jos\/bayes\/bayes. htmlhttps:\/\/www.abet.org\/accreditation\/accreditation-criteria\/criteria-foraccrediting-computing-programs-2021--2022\/. ABET-CAC. 2021. Criteria for Accrediting Computing Programs 2021--2022. Retrieved November 7, 2021 from http:\/\/ccrma.stanford.edu\/~jos\/bayes\/bayes. htmlhttps:\/\/www.abet.org\/accreditation\/accreditation-criteria\/criteria-foraccrediting-computing-programs-2021--2022\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362929.362976"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/359080.359083"},{"key":"e_1_3_2_1_5_1","volume-title":"Retrieved","author":"ACM","year":"1991","unstructured":"ACM and IEEE-CS. 1991 . Computing Curricula 1991 . Retrieved November 16, 2021 from https:\/\/dl-acm-org.dml.regis.edu\/doi\/book\/10.1145\/2594148. ACM and IEEE-CS. 1991. Computing Curricula 1991. Retrieved November 16, 2021 from https:\/\/dl-acm-org.dml.regis.edu\/doi\/book\/10.1145\/2594148."},{"key":"e_1_3_2_1_6_1","volume-title":"Retrieved","author":"ACM","year":"2001","unstructured":"ACM and IEEE-CS. 2001 . Computing Curricula 2001 Computer Science . Retrieved November 16, 2021 from https:\/\/www.acm.org\/binaries\/content\/assets\/education\/ curricula-recommendations\/cc2001.pdf. ACM and IEEE-CS. 2001. Computing Curricula 2001 Computer Science. Retrieved November 16, 2021 from https:\/\/www.acm.org\/binaries\/content\/assets\/education\/ curricula-recommendations\/cc2001.pdf."},{"key":"e_1_3_2_1_7_1","volume-title":"Computer Science Curricula","author":"IEEE-CS.","year":"2013","unstructured":"ACM\/ IEEE-CS. 2013. Computer Science Curricula 2013 . Retrieved November 7, 2021 from http:\/\/dx.doi.org\/10.1145\/2534860. ACM\/IEEE-CS. 2013. Computer Science Curricula 2013. Retrieved November 7, 2021 from http:\/\/dx.doi.org\/10.1145\/2534860."},{"key":"e_1_3_2_1_8_1","volume-title":"Ullman","author":"Aho Alfered V.","year":"1974","unstructured":"Alfered V. Aho , John E. Hopcroft , and Jeffrey D . Ullman . 1974 . The design and analysis of computer algorithms. Addison-Wesley Publishing , Reading, MA, USA. Alfered V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley Publishing, Reading, MA, USA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.learninstruc.2006.03.001"},{"key":"e_1_3_2_1_10_1","volume-title":"Retrieved","author":"Complete College America.","year":"2012","unstructured":"Complete College America. 2012 . Program requirements for Associate's and Bachelor's degrees: A national survey . Retrieved November 15, 2021 from https:\/\/www.insidehighered.com\/sites\/default\/server_files\/files\/Program% 20Requirements%20-%20A%20National%20Survey(1).pdf Complete College America. 2012. Program requirements for Associate's and Bachelor's degrees: A national survey. Retrieved November 15, 2021 from https:\/\/www.insidehighered.com\/sites\/default\/server_files\/files\/Program% 20Requirements%20-%20A%20National%20Survey(1).pdf"},{"key":"e_1_3_2_1_11_1","volume-title":"Retrieved","author":"Biasi Marzio De","year":"2015","unstructured":"Marzio De Biasi . 2015 . Using Kolmogorov complexity to solve the halting problem . Retrieved November 21, 2021 from https:\/\/www.nearly42.org\/cstheory\/halting_ to_kolmogorov\/. Marzio De Biasi. 2015. Using Kolmogorov complexity to solve the halting problem. Retrieved November 21, 2021 from https:\/\/www.nearly42.org\/cstheory\/halting_ to_kolmogorov\/."},{"key":"e_1_3_2_1_12_1","first-page":"40","article-title":"Walking the curricular talk: A longitudinal study of computer science departmental course requirements","volume":"37","author":"Blumenthal Richard","year":"2021","unstructured":"Richard Blumenthal . 2021 . Walking the curricular talk: A longitudinal study of computer science departmental course requirements . The Journal of Computing Sciences in Colleges 37 , 2 (2021), 40 -- 49 . https:\/\/doi.org\/10.1145\/1240200.1240202 Richard Blumenthal. 2021. Walking the curricular talk: A longitudinal study of computer science departmental course requirements. The Journal of Computing Sciences in Colleges 37, 2 (2021), 40--49. https:\/\/doi.org\/10.1145\/1240200.1240202","journal-title":"The Journal of Computing Sciences in Colleges"},{"key":"e_1_3_2_1_13_1","volume-title":"press. Alignment among normative, prescriptive, and descriptive models of computer science curriculum: The effect of ABET accreditation on CS education. ACM Transactions on Computing Education","author":"Blumenthal Richard","unstructured":"Richard Blumenthal . In press. Alignment among normative, prescriptive, and descriptive models of computer science curriculum: The effect of ABET accreditation on CS education. ACM Transactions on Computing Education ( In press) . Richard Blumenthal. In press. Alignment among normative, prescriptive, and descriptive models of computer science curriculum: The effect of ABET accreditation on CS education. ACM Transactions on Computing Education (In press)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3316\/QRJ0902027"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 8th International Conference on Education and Information Technology (ICEIT'19)","author":"Bqa Rabranea","unstructured":"Rabranea Bqa , Tanzeela Shakeel , and Yaswer D. Khan . 2019. A Pedagogical Approach towards Theory of Computation . In Proceedings of the 8th International Conference on Education and Information Technology (ICEIT'19) (ICEIT '19). ACM Press, New York, NY, USA, 192--197. Rabranea Bqa, Tanzeela Shakeel, and Yaswer D. Khan. 2019. A Pedagogical Approach towards Theory of Computation. In Proceedings of the 8th International Conference on Education and Information Technology (ICEIT'19) (ICEIT '19). ACM Press, New York, NY, USA, 192--197."},{"key":"e_1_3_2_1_16_1","unstructured":"G. Chaitin A. Arslanov and C. Calude. 1995. Program-size complexity computes the halting problem. CDMTCS Research Report CDMTCS-008. IBM Research Division New York USA.  G. Chaitin A. Arslanov and C. Calude. 1995. Program-size complexity computes the halting problem. CDMTCS Research Report CDMTCS-008. IBM Research Division New York USA."},{"key":"e_1_3_2_1_17_1","volume-title":"The Calculi of Lambda-Conversion","author":"Church Alonzo","unstructured":"Alonzo Church . 1941. The Calculi of Lambda-Conversion . Princeton University Press , Princeton, NJ, USA . Alonzo Church. 1941. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, NJ, USA."},{"key":"e_1_3_2_1_18_1","volume-title":"Introduction to Computer Theory","author":"Cohen Daniel","unstructured":"Daniel Cohen . 1997. Introduction to Computer Theory ( 2 nd ed.). John Wiley Sons , Hoboken, NJ, USA . Daniel Cohen. 1997. Introduction to Computer Theory (2nd ed.). John Wiley Sons, Hoboken, NJ, USA.","edition":"2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408877.3432475"},{"key":"e_1_3_2_1_20_1","volume-title":"Martell","author":"Denning Peter J.","year":"2015","unstructured":"Peter J. Denning and Braig H . Martell . 2015 . Great principles of computing. MIT Press , Cambridge, MA, USA. Peter J. Denning and Braig H. Martell. 2015. Great principles of computing. MIT Press, Cambridge, MA, USA."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562176"},{"key":"e_1_3_2_1_22_1","volume-title":"The new Turing omnibus: 66 exursions in computer science","author":"Dewdney A. K.","unstructured":"A. K. Dewdney . 1993. The new Turing omnibus: 66 exursions in computer science . Henry Holt and Company , New York, NY, USA . A. K. Dewdney. 1993. The new Turing omnibus: 66 exursions in computer science. Henry Holt and Company, New York, NY, USA."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of ACM International Computing Education Research Conference (ICER'19)","author":"Dziallas Sebastian","year":"2009","unstructured":"Sebastian Dziallas and Sally Fincher . 2009 . A Pedagogical Approach towards Theory of Computation. In ACM Curriculum Reports: A Pedagogic Perspective . Proceedings of ACM International Computing Education Research Conference (ICER'19) (ICER '19). ACM Press, New York, NY, USA, 81--89. Sebastian Dziallas and Sally Fincher. 2009. A Pedagogical Approach towards Theory of Computation. In ACM Curriculum Reports: A Pedagogic Perspective. Proceedings of ACM International Computing Education Research Conference (ICER'19) (ICER '19). ACM Press, New York, NY, USA, 81--89."},{"key":"e_1_3_2_1_24_1","volume-title":"Carnielli","author":"Epstein Richard L.","year":"2008","unstructured":"Richard L. Epstein and Walter A . Carnielli . 2008 . Computability : Computable Functions, Logic, and the Foundations of Mathematics (3rd ed.). Advanced Reasoning Forum, Sicora, NM, USA. Richard L. Epstein and Walter A. Carnielli. 2008. Computability: Computable Functions, Logic, and the Foundations of Mathematics (3rd ed.). Advanced Reasoning Forum, Sicora, NM, USA."},{"key":"e_1_3_2_1_25_1","volume-title":"Models of Computation: An Introduction to Computability Theory","author":"Fern\u00e1ndez Maribel","unstructured":"Maribel Fern\u00e1ndez . 2009. Models of Computation: An Introduction to Computability Theory ( 3 rd ed.). Springer-Verlag , London, England . Maribel Fern\u00e1ndez. 2009. Models of Computation: An Introduction to Computability Theory (3rd ed.). Springer-Verlag, London, England.","edition":"3"},{"key":"e_1_3_2_1_26_1","volume-title":"The Feynman lectures on Physics","author":"Feynman Richard P.","unstructured":"Richard P. Feynman , Robert B. Leighton , , and Matthew Sands . 1963. The Feynman lectures on Physics . Addison-Wesley Publishing Company , Reading, MA, USA . Richard P. Feynman, Robert B. Leighton, , and Matthew Sands. 1963. The Feynman lectures on Physics. Addison-Wesley Publishing Company, Reading, MA, USA."},{"key":"e_1_3_2_1_27_1","volume-title":"Retrieved","author":"CC2020 Task Force","year":"2020","unstructured":"CC2020 Task Force . 2020 . Computing curricula 2020 (CC2020) . Retrieved November 15, 2021 from https:\/\/www.acm.org\/binaries\/content\/assets\/education\/ curricula-recommendations\/cc2020.pdf. CC2020 Task Force. 2020. Computing curricula 2020 (CC2020). Retrieved November 15, 2021 from https:\/\/www.acm.org\/binaries\/content\/assets\/education\/ curricula-recommendations\/cc2020.pdf."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01700692"},{"key":"e_1_3_2_1_29_1","volume-title":"Ullman","author":"Hopcroft John E.","year":"1974","unstructured":"John E. Hopcroft , Rajeev Motwani , and Jeffrey D . Ullman . 1974 . Introduction to Automata Theory, Languages, and Computation. Addison-Wesley , Boston, MA, USA. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 1974. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston, MA, USA."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01565439"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/142040.142075"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240200.1240202"},{"key":"e_1_3_2_1_33_1","volume-title":"Introduction to the design & analysis of algorithms","author":"Levitin Anany","unstructured":"Anany Levitin . 2007. Introduction to the design & analysis of algorithms ( 2 nd ed.). Pearson Education Inc., Boston, MA, USA. Anany Levitin. 2007. Introduction to the design & analysis of algorithms (2nd ed.). Pearson Education Inc., Boston, MA, USA.","edition":"2"},{"key":"e_1_3_2_1_34_1","volume-title":"An Introduction to Formal Languages and Automata","author":"Linz Peter","unstructured":"Peter Linz . 2012. An Introduction to Formal Languages and Automata ( 5 th ed.). Jones Bartlett Learning LLC, Sudbury, MA , USA. Peter Linz. 2012. An Introduction to Formal Languages and Automata (5th ed.). Jones Bartlett Learning LLC, Sudbury, MA, USA.","edition":"5"},{"key":"e_1_3_2_1_35_1","volume-title":"Programming the universe","author":"Lloyd Seth","unstructured":"Seth Lloyd . 2006. Programming the universe . Vintage Books, New York, NY , USA. Seth Lloyd. 2006. Programming the universe. Vintage Books, New York, NY, USA."},{"key":"e_1_3_2_1_36_1","volume-title":"Introduction to Languages and the Theory of Computation","author":"Martin John C.","unstructured":"John C. Martin . 2010. Introduction to Languages and the Theory of Computation . McGraw-Hill Education, New York, NY , USA. John C. Martin. 2010. Introduction to Languages and the Theory of Computation. McGraw-Hill Education, New York, NY, USA."},{"key":"e_1_3_2_1_37_1","first-page":"62","article-title":"Training, education, development, and learning: What is the difference","volume":"8","author":"Masadeh Mousa","year":"2012","unstructured":"Mousa Masadeh . 2012 . Training, education, development, and learning: What is the difference ? European Scientific Journal 8 , 10 (2012), 62 -- 68 . Mousa Masadeh. 2012. Training, education, development, and learning: What is the difference? European Scientific Journal 8, 10 (2012), 62--68.","journal-title":"European Scientific Journal"},{"key":"e_1_3_2_1_38_1","volume-title":"Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers","author":"Odefreddi Piergiorgio","unstructured":"Piergiorgio Odefreddi . 1989. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers . Elsevier Science B.V. , Amsterdam, The Netherlands. Piergiorgio Odefreddi. 1989. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Elsevier Science B.V., Amsterdam, The Netherlands."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269031"},{"key":"e_1_3_2_1_40_1","volume-title":"Automata, Computability, and Complexity: Theory and Applications","author":"Rich Elaine","unstructured":"Elaine Rich . 2008. Automata, Computability, and Complexity: Theory and Applications . Pearson Education Inc, Upper Saddle River, NJ, USA. Elaine Rich. 2008. Automata, Computability, and Complexity: Theory and Applications. Pearson Education Inc, Upper Saddle River, NJ, USA."},{"key":"e_1_3_2_1_41_1","volume-title":"Introduction to the Theory of Computation. Cengage Learning","author":"Sipser Michael","unstructured":"Michael Sipser . 2013. Introduction to the Theory of Computation. Cengage Learning , Boston, MA, USA . Michael Sipser. 2013. Introduction to the Theory of Computation. Cengage Learning, Boston, MA, USA."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/420992"},{"key":"e_1_3_2_1_43_1","volume-title":"Recursive Function Theory. Retrieved","author":"Stone John D.","year":"2021","unstructured":"John D. Stone . 2011. Recursive Function Theory. Retrieved November 7, 2021 from https:\/\/unity.homelinux.net\/rft\/rft.pdf. John D. Stone. 2011. Recursive Function Theory. Retrieved November 7, 2021 from https:\/\/unity.homelinux.net\/rft\/rft.pdf."},{"key":"e_1_3_2_1_44_1","volume-title":"Languages and Machines: An Introduction to the Theory of Computer Science","author":"Sudkamp Thomas A.","unstructured":"Thomas A. Sudkamp . 2005. Languages and Machines: An Introduction to the Theory of Computer Science ( 3 rd ed.). Boston, MA , USA. Thomas A. Sudkamp. 2005. Languages and Machines: An Introduction to the Theory of Computer Science (3rd ed.). Boston, MA, USA.","edition":"3"},{"key":"e_1_3_2_1_45_1","first-page":"230","article-title":"On Computable Numbers, with an Application to the Entsheidungsproblem","volume":"2","author":"Turing Alan","year":"1936","unstructured":"Alan Turing . 1936 . On Computable Numbers, with an Application to the Entsheidungsproblem . Proceedings of the London Mathematical Society 2 , 42 (1936), 230 -- 265 . Alan Turing. 1936. On Computable Numbers, with an Application to the Entsheidungsproblem. Proceedings of the London Mathematical Society 2, 42 (1936), 230--265.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268280"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog1801_3"}],"event":{"name":"SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education","location":"Providence RI USA","acronym":"SIGCSE 2022","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 53rd ACM Technical Symposium on Computer Science Education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478431.3499309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3478431.3499309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:26Z","timestamp":1750191506000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478431.3499309"}},"subtitle":["A Case for Teaching Multiple Representations of the Church-Turing Thesis"],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":47,"alternative-id":["10.1145\/3478431.3499309","10.1145\/3478431"],"URL":"https:\/\/doi.org\/10.1145\/3478431.3499309","relation":{},"subject":[],"published":{"date-parts":[[2022,2,22]]}}}