Martínez Alonso, Juan CarlosGarcia i Serrano, Aniol2024-05-092024-05-092024-01-15https://hdl.handle.net/2445/211081Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2024, Director: Juan Carlos Martínez Alonso[en] The proposition in 1928 of David Hilbert’s Entscheidungsproblem, led to the development of the theory of computability, which seeks to understand what can and cannot be computed. This work aims to be an introduction to this field. During its development, the fundamental concepts of automata theory and formal languages will be shown, along with Turing machines and the Church-Turing thesis, to finally see that there are undecidable problems and show some examples of them.64 p.application/pdfcatmemòria: cc-nc-nd (c) Aniol Garcia i Serrano, 2024http://creativecommons.org/licenses/by-nc-nd/3.0/es/Decidibilitat (Lògica matemàtica)Funciones computablesMàquines de TuringTeoria de la computacióProgramariTreballs de fi de grauDecidability (Mathematical logic)Computable functionsTuring machinesTheory of computationComputer softwareBachelor's thesesinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess