Yahoo Search Busca da Web

Resultado da Busca

  1. Procuraremos demonstrar que von Neumann teve contribuições importantes nas áreas de arquitetura de computadores, princípios de programação, análise de algoritmos, análise numérica, computação científica, teoria dos autômatos, redes neurais, tolerância a falhas, sendo o verdadeiro fundador de algumas delas.

    • Tomasz Kowaltowski
    • 1996
  2. 1 de mar. de 2019 · Abstract. In this chapter fundamental problems of collaborative computational intelligence are discussed. The problems are distilled from the seminal research of Alan Turing and John von Neumann. For Turing the creation of machines with human-like intelligence was only a question of programming time.

    • Heinz Mühlenbein
    • 2009
  3. 9 de mar. de 2023 · This article provides a detailed analysis of the transfer of a key cluster of ideas from mathematical logic to computing. We demonstrate the impact of certain of Turing’s logico-philosophical ...

  4. 10.1 Shannon for Dummies Before we can understand Von Neumann entropy and its relevance to quantum infor-mation, we should discuss Shannon entropy and its relevance to classical information. Claude Shannon established the two core results of classical information theory in his landmark 1948 paper. The two central problems that he solved were: 1.

    • 635KB
    • 96
  5. 14 de jun. de 2014 · Ten years later, von Neumann died, leaving his pioneering volume The Computer and the Brain unfinished. There are only two names mentioned in the volume: Alan Turing and Claude Shannon. Alan Turing was a British logician and cryptologist, celebrated for cracking the German Naval Enigma code during World War II at the Government Codes ...

  6. capitals mostly, Claude Elwood Shannon figures alongside other luminaries such as John von Neumann or Alan Turing. As the “father” of information theory, the math-ematician and engineer Shannon, who spent most of his career at Bell Labs, has become lionized and consecrated for both computer scientists and communications engineers.

  7. resumo. Este artigo apresenta, qualitativamente, os conceitos de complexidade computacional algorítmica (Turing) e de complexidade computacional informacional (Shannon), enfatizando como pensamentos independentes, de naturezas diferentes, produziram conceitos matemáticos similares e de grande utilidade para a computação moderna. palavras-chave: