Teorema do Isomorfismo de Rogers e Aplicações em Criptologia (Rogers' Isomorphism Theorem and Cryptology Applications)

Flávio Luis de Mello (flavioluis.mello@gmail.com)1, Roberto Lins de Carvalho (flavioluis.mello@gmail.com)2

1Federal University of Rio de Janeiro
2Witty Group

This paper appears in: Revista IEEE América Latina

Publication Date: June 2015
Volume: 13,   Issue: 6 
ISSN: 1548-0992

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.

Index Terms:
algorithm, recursive functions, Church-Turing Thesis, fixed point theorem, recursion theorem, isomorphism theorem   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (376)]