Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/211081| Title: | Sobre la decidibilitat de problemes computacionals |
| Author: | Garcia i Serrano, Aniol |
| Director/Tutor: | Martínez Alonso, Juan Carlos |
| Keywords: | Decidibilitat (Lògica matemàtica) Funciones computables Màquines de Turing Teoria de la computació Programari Treballs de fi de grau Decidability (Mathematical logic) Computable functions Turing machines Theory of computation Computer software Bachelor's theses |
| Issue Date: | 15-Jan-2024 |
| 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. |
| Note: | Treballs Finals de Grau d'Enginyeria Informàtica, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2024, Director: Juan Carlos Martínez Alonso |
| URI: | http://hdl.handle.net/2445/211081 |
| Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques Treballs Finals de Grau (TFG) - Enginyeria Informàtica |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| tfg_garcia_i_serrano_Aniol.pdf | Memòria | 847.76 kB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License
