{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:03Z","timestamp":1750307703524,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T00:00:00Z","timestamp":1245888000000},"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":["SIGCSE Bull."],"published-print":{"date-parts":[[2009,6,25]]},"abstract":"<jats:p>We present a programming approach to teach the reduction technique in a computing engineering degree's Computability Theory course. It is based in a computing formalism that allows the students to analyze, construct and transform programs as normal data in a simple way. Reduction can then be tackled in a constructive manner, so that the students benefit from their programming skills to prove uncomputability results without the help of the Parametrization (S-m-n) Theorem. Additionally the method is suitable to be applied to interesting problems that cannot be handled by diagonalization nor classical reduction.<\/jats:p>","DOI":"10.1145\/1595453.1595482","type":"journal-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T14:08:31Z","timestamp":1251122911000},"page":"90-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructive reduction"],"prefix":"10.1145","volume":"41","author":[{"given":"Jes\u00fas","family":"Ib\u00e1\u00f1ez","sequence":"first","affiliation":[{"name":"Basque Country University, Donostia, Spain"}]},{"given":"Ana","family":"S\u00e1nchez","sequence":"additional","affiliation":[{"name":"Basque Country University, Donostia, Spain"}]}],"member":"320","published-online":{"date-parts":[[2009,6,25]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"ACM\/AIS\/IEE-CS Task Force. Computing Curriculum 2005.  ACM\/AIS\/IEE-CS Task Force. Computing Curriculum 2005."},{"volume-title":"Benjamin-Cummings","year":"1989","author":"Brookshear J. G.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139171496"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Davis M.D. Weyuker E. J. Computability Complexity and Languages. Academic Press 1983.   Davis M.D. Weyuker E. J. Computability Complexity and Languages. Academic Press 1983.","DOI":"10.1016\/B978-0-12-206380-0.50020-1"},{"volume-title":"Ellis Horword","year":"1991","author":"Dunne P. E.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Hermes H. Enumerability Decidability Computability. Springer 1965.  Hermes H. Enumerability Decidability Computability. Springer 1965.","DOI":"10.1007\/978-3-662-11686-9"},{"key":"e_1_2_1_7_1","unstructured":"Hopcroft J.E. Motwani R. Ullman J.D. Introduction to Automata Theory Languages and Computation. Addison Wesley; 3 edition 2006.   Hopcroft J.E. Motwani R. Ullman J.D. Introduction to Automata Theory Languages and Computation. Addison Wesley; 3 edition 2006."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/574508"},{"key":"e_1_2_1_9_1","unstructured":"Lewis H. Papadimitriou C.H. Elements of the theory of computation Prentice-Hall second edition 1997.   Lewis H. Papadimitriou C.H. Elements of the theory of computation Prentice-Hall second edition 1997."},{"key":"e_1_2_1_10_1","unstructured":"Lowther J.L. Shene C. Toward an intuitive and interesting theory course: the first step of a road map. Journal of Computing Science in colleges 20 1 (October 2004).   Lowther J.L. Shene C. Toward an intuitive and interesting theory course: the first step of a road map. Journal of Computing Science in colleges 20 1 (October 2004)."},{"volume-title":"Prentice-Hall","year":"1984","author":"Mallozzi J.S.","key":"e_1_2_1_11_1"},{"volume-title":"Addison-Wesley","year":"1998","author":"Moret B.M.E.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","unstructured":"Rich E. Automata Computability and Complexity. Pearson Prentice Hall 2008.  Rich E. Automata Computability and Complexity. Pearson Prentice Hall 2008."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/210594"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/22895"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227504.1227463"},{"volume-title":"Liberal Arts Computer Science Consortium. A 2004 model for a liberal arts degree in computer science.","year":"2004","author":"The","key":"e_1_2_1_17_1"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1595453.1595482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1595453.1595482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:04Z","timestamp":1750253404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1595453.1595482"}},"subtitle":["understanding uncomputability through programming"],"short-title":[],"issued":{"date-parts":[[2009,6,25]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6,25]]}},"alternative-id":["10.1145\/1595453.1595482"],"URL":"https:\/\/doi.org\/10.1145\/1595453.1595482","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2009,6,25]]},"assertion":[{"value":"2009-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}