Rogers' Isomorphism Theorem and Cryptology Applications

This paper presents a Theory of Computation study based on recursive functions computability and innovates by performing parallels to relevant themes of Cryptography. Hence, it is presented the Hennie\´s notion of "abstract family of algorithms" (AFA, for short) according to the authors\´ understanding, and also more judicious theorems demonstrations, many times completely different from those ones available in literature. The main issue is the Isomorphism Theorem which supports the Church-Turing Thesis and provides a connection between Cryptology and Linguistics.