Journal ArticleOPEN ACCESS

Complexidade computacional e medida da informação: Caminhos de turing e Shannon

Estudos Avancados (2016) 30(87) 339-344
DOI: 10.1590/S0103-40142016.30870020
0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This 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.

Author supplied keywords

Cite

CITATION STYLE

APA

Piqueira, J. R. C. (2016). Complexidade computacional e medida da informação: Caminhos de turing e Shannon. Estudos Avancados, 30(87), 339–344. https://doi.org/10.1590/S0103-40142016.30870020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free