Complexidade computacional e medida da informação: caminhos de Turing e ShannonThis paper qualitatively presents the concepts of algorithmic computational complexity (Turing) and informational computational complexity (Shannon), emphasizing how independent thinking, of different nature, produced similar mathematical concepts with great usefulness for modern computation..
keywords:
Complexity; Turing machine; Computational measures
