Martínez Alonso, Juan CarlosVendrell Titó, Pau2022-05-202022-05-202021-06-18https://hdl.handle.net/2445/185826Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Juan Carlos Martínez Alonso[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.45 p.application/pdfcatcc-by-nc-nd (c) Pau Vendrell Titó, 2021http://creativecommons.org/licenses/by-nc-nd/3.0/es/Màquines de TuringTreballs de fi de grauAlgorismes computacionalsTeoria de la computacióLògica matemàticaTuring machinesBachelor's thesesComputer algorithmsTheory of computationMathematical logicinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess