A natural axiomatization of computability and proof of Church's Thesis

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones. which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here. we show that augmenting those Postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's Thesis, as Godel and others suggested may be possible. In a similar way, but with a different set of basic operations. one can prove Turing's Thesis, characterizing the effective string functions, and-in particular-the effectively-computable functions on string representations of numbers.