Amb motiu del tancament d'estiu, la validació de documents es reprendrà a partir del 28 d'agost de 2026. Disculpeu les molèsties.
Con motivo del cierre de verano, la validación de documentos se reanudará a partir del 28 de agosto de 2026. Disculpad las molestias
Due to the summer closure, document validation will resume starting August 28, 2026. We apologize for any inconvenience.

Document type

Bachelor thesis

Publication date

Publication license

memòria: cc-nc-nd (c) Aniol Garcia i Serrano, 2024
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

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

Export metadata

JSON - METS

Share record