Tesis de Church-Turing

Vista senzilla d'ítem
dc.contributor.advisorMartínez Alonso, Juan Carlos
dc.contributor.authorVendrell Titó, Pau
dc.date.accessioned2022-05-20T07:33:40Z
dc.date.available2022-05-20T07:33:40Z
dc.date.issued2021-06-18
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Juan Carlos Martínez Alonsoca
dc.description.abstract[en] Church-Turing thesis states that the intuitive notion of an algorithm corresponds to the notion of a Turing machine. In this work we will show the main arguments that support this claim: the implementation of the basic algorithmic structures by means of Turing machines, and specially the equivalence between the notion of a Turing machine and other mathematical formulations of the notion of an algorithm.ca
dc.format.extent45 p.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2445/185826
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Pau Vendrell Titó, 2021
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques
dc.subject.classificationMàquines de Turingca
dc.subject.classificationTreballs de fi de grau
dc.subject.classificationAlgorismes computacionalsca
dc.subject.classificationTeoria de la computacióca
dc.subject.classificationLògica matemàticaca
dc.subject.otherTuring machinesen
dc.subject.otherBachelor's theses
dc.subject.otherComputer algorithmsen
dc.subject.otherTheory of computationen
dc.subject.otherMathematical logicen
dc.titleTesis de Church-Turingca
dc.typeinfo:eu-repo/semantics/bachelorThesisca

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Miniatura
Nom:
tfg_vendrell_tito_pau.pdf
Mida:
577.1 KB
Format:
Adobe Portable Document Format
Descripció:
Memòria
Descarregar

Col·leccions

Treballs Finals de Grau (TFG) - Matemàtiques