Document type
Bachelor thesisPublication date
Publication license
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/211081
Sobre la decidibilitat de problemes computacionals
Journal Title
Authors
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
[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.
Description
Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2024, Director: Juan Carlos Martínez Alonso
Citation
Citation
GARCIA I SERRANO, Aniol. Sobre la decidibilitat de problemes computacionals. [consulted: 10 of August of 2026]. Available at: https://hdl.handle.net/2445/211081