{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:22:27Z","timestamp":1765232547307,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,21]],"date-time":"2018-02-21T00:00:00Z","timestamp":1519171200000},"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":[],"published-print":{"date-parts":[[2018,2,21]]},"DOI":"10.1145\/3159450.3159557","type":"proceedings-article","created":{"date-parts":[[2018,2,21]],"date-time":"2018-02-21T16:46:16Z","timestamp":1519231576000},"page":"521-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Strategies for Basing the CS Theory Course on Non-decision Problems"],"prefix":"10.1145","author":[{"given":"John","family":"MacCormick","sequence":"first","affiliation":[{"name":"Dickinson College, Carlisle, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/782941.782975"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462476.2465582"},{"edition":"2","volume-title":"Fundamentals of Theoretical Computer Science","author":"Davis Martin","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1822090.1822118"},{"edition":"2","volume-title":"Creating significant learning experiences: An integrated approach to designing college courses","author":"Fink L Dee","key":"e_1_3_2_1_7_1"},{"volume-title":"NP, and the search for the impossible","author":"Fortnow Lance","key":"e_1_3_2_1_8_1"},{"volume-title":"On Teaching the Basics of Complexity Theory","author":"Goldreich Oded","key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/11685654_15"},{"volume-title":"The Basics of Computational Complexity","author":"Goldreich Oded","key":"e_1_3_2_1_10_1"},{"volume-title":"Ullman","year":"2006","author":"Hopcroft John E.","key":"e_1_3_2_1_11_1"},{"edition":"2","volume-title":"Elements of the Theory of Computation","author":"Lewis Harry R","key":"e_1_3_2_1_12_1"},{"edition":"5","volume-title":"An Introduction to Formal Languages and Automata","author":"Linz Peter","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","first-page":"6","article-title":"NP-completeness for All Computer Science Undergraduates: A Novel Project-based Curriculum","volume":"21","author":"Lobo Andrea F.","year":"2006","journal-title":"J. Comput. Sci. Coll."},{"volume-title":"What Can Be Computed?: A Practical Guide to the Theory of Computation","author":"MacCormick John","key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctv33pb07s"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008902.1008904"},{"volume-title":"The Nature of Computation","author":"Moore Cristopher","key":"e_1_3_2_1_18_1"},{"volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","key":"e_1_3_2_1_19_1"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Papadimitriou Christos H","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","unstructured":"Elaine Rich. 2007. Automata Computability and Complexity: Theory and Applications. Pearson.   Elaine Rich. 2007. Automata Computability and Complexity: Theory and Applications. Pearson."},{"key":"e_1_3_2_1_22_1","unstructured":"Susan H Rodger and Thomas W Finley. 2006. JFLAP: an interactive formal languages and automata package. Jones & Bartlett Learning.   Susan H Rodger and Thomas W Finley. 2006. JFLAP: an interactive formal languages and automata package. Jones & Bartlett Learning."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1539024.1509011"},{"edition":"3","volume-title":"Introduction to the Theory of Computation","author":"Sipser Michael","key":"e_1_3_2_1_24_1"}],"event":{"name":"SIGCSE '18: The 49th ACM Technical Symposium on Computer Science Education","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Baltimore Maryland USA","acronym":"SIGCSE '18"},"container-title":["Proceedings of the 49th ACM Technical Symposium on Computer Science Education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159450.3159557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3159450.3159557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:25Z","timestamp":1750213585000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3159450.3159557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,21]]},"references-count":23,"alternative-id":["10.1145\/3159450.3159557","10.1145\/3159450"],"URL":"https:\/\/doi.org\/10.1145\/3159450.3159557","relation":{},"subject":[],"published":{"date-parts":[[2018,2,21]]},"assertion":[{"value":"2018-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}