Refundar la Ciencia de la computación: Demostrar la tesis de Church-Turing-Post bajo la clausura conceptual definitiva de cálculo efectivo

Since the time of Euclid, informal notions upon which mathematics rested, such as limit, function, and set, have been formalized, with the notable exception of effective calculability. This work does not present a specific definition or attempt to axiomatize its properties. Instead, it delineates the concept's definitional space by referring to the physical finitude of every implementation. Next, it is proven that a proposed formalism fully captures that delimitation. Finally, the proof of equivalence is extended to the classical formalisms, so that the Church-Turing-Post thesis ceases to be an inductive hypothesis and becomes a theorem.