- Codificación de una máquina de Turing
- Se presenta un mecanismo para codificar una máquina de Turing
- Máquina de Turing Universal
- Se presenta a la MTU
- Máquinas para máquinas
- Se exploran escenarios donde MT reciben descripciones éstandar de MT
- El problema del paro
- Se presenta el problema del paro
- Consecuencia de ser no decidible
- Se presentan varias observaciones sobre las consecuencias de que problema del paro sea no decidible
- El complemento de los no decidibles
- Se ahonda en el concepto de complemento de no decidibles
Enlaces para explorar #
- The Halting Problem: The Unsolvable Problem. (2020, abril 22). [Video]
- Turing & The Halting Problem - Computerphile. (2014, agosto 21). [Video]
- How This One Question Breaks Computers. (2023, june 21). [Video]
- The Halting Problem - An Impossible Problem to Solve. (2018, julio 20). [Video]
- Are There Problems That Computers Can’t Solve?. (2020, mayo 11) [Video]
- Turing Machines - How Computer Science Was Created By Accident. (2020, febrero 4). [Video]
- Turing Machines Explained - Computerphile. (2014, agosto 29). [Video]
- Turing machines explained visually. (2017, mayo 17). [Video]
- A Turing Machine - Overview. (2010, marzo 7). [Video]
- Alan Turing’s 100th Birthday - Doodle/Google. (2012, junio 23). [Sitio web]
- Máquina de Turing. [Wikipedia]
- Turing machine. [Wikipedia]
- Turing machine equivalents. [Wikipedia]
- Turing Machine Alternative (Counter Machines) - Computerphile. (2023, septiembre 4). [Video]
Lecturas recomendadas #
- Turing, A.M. (1936). “On Computable Numbers, with an Application to the Entscheidungsproblem”. Proceedings of the London Mathematical Society. 2 (published 1937). 42: 230–265. Liga.
- Turing, A.M. (1938). “On Computable Numbers, with an Application to the Entscheidungsproblem: A correction”. Proceedings of the London Mathematical Society. 2 (published 1937). 43 (6): 544–6. Liga. Reprinted in many collections, e.g. in The Undecidable, pp. 115–154; available on the web in many places.
- O’Regan, G. (2012). Alan Turing. In: A Brief History of Computing. Springer,
London.
[ BiDi/UNAM], [ Liga] - B. Jack Copeland ed. (2004), The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma, Clarendon Press (Oxford University Press), Oxford UK. [ Liga]