Resultado da Busca
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
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
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 ...
- Overview
- Early life and education
- European career, 1921–30
John von Neumann (born December 28, 1903, Budapest, Hungary—died February 8, 1957, Washington, D.C., U.S.) Hungarian-born American mathematician. As an adult, he appended von to his surname; the hereditary title had been granted his father in 1913. Von Neumann grew from child prodigy to one of the world’s foremost mathematicians by his mid-twenties...
Von Neumann grew up in an affluent, highly assimilated Jewish family. His father, Miksa Neumann (Max Neumann), was a banker, and his mother, born Margit Kann (Margaret Kann), came from a family that had prospered selling farm equipment. Von Neumann showed signs of genius in early childhood: he could joke in Classical Greek and, for a family stunt, ...
Von Neumann commenced his intellectual career at a time when the influence of David Hilbert and his program of establishing axiomatic foundations for mathematics was at a peak. A paper von Neumann wrote while still at the Lutheran Gymnasium (“The Introduction of Transfinite Ordinals,” published 1923) supplied the now-conventional definition of an ordinal number as the set of all smaller ordinal numbers. This neatly avoids some of the complications raised by Georg Cantor’s transfinite numbers. Von Neumann’s “An Axiomatization of Set Theory” (1925) commanded the attention of Hilbert himself. From 1926 to 1927 von Neumann did postdoctoral work under Hilbert at the University of Göttingen. The goal of axiomatizing mathematics was defeated by Kurt Gödel’s incompleteness theorems, a barrier that was understood immediately by Hilbert and von Neumann. (See also mathematics, foundations of: Gödel.)
Von Neumann took positions as a Privatdozent (“private lecturer”) at the Universities of Berlin (1927–29) and Hamburg (1929–30). The work with Hilbert culminated in von Neumann’s book The Mathematical Foundations of Quantum Mechanics (1932), in which quantum states are treated as vectors in a Hilbert space. This mathematical synthesis reconciled the seemingly contradictory quantum mechanical formulations of Erwin Schrödinger and Werner Heisenberg. Von Neumann also claimed to prove that deterministic “hidden variables” cannot underlie quantum phenomena. This influential result pleased Niels Bohr and Heisenberg and played a strong role in convincing physicists to accept the indeterminacy of quantum theory. In contrast, the result dismayed Albert Einstein, who refused to abandon his belief in determinism. (Ironically, Irish-born physicist John Stewart Bell demonstrated in the mid-1960s that von Neumann’s proof was flawed; Bell then fixed the proof’s shortcomings, reaffirming von Neumann’s conclusion that hidden variables were unnecessary. See also quantum mechanics: Hidden variables.)
Britannica Quiz
Numbers and Mathematics
By his mid-twenties, von Neumann found himself pointed out as a wunderkind at conferences. (He claimed that mathematical powers start to decline at age 26, after which experience can conceal the deterioration for a time.) Von Neumann produced a staggering succession of pivotal papers in logic, set theory, group theory, ergodic theory, and operator theory. Herman Goldstine and Eugene Wigner noted that, of all the principal branches of mathematics, it was only in topology and number theory that von Neumann failed to make an important contribution.
In 1928 von Neumann published “Theory of Parlor Games,” a key paper in the field of game theory. The nominal inspiration was the game of poker. Game theory focuses on the element of bluffing, a feature distinct from the pure logic of chess or the probability theory of roulette. Though von Neumann knew of the earlier work of the French mathematician Émile Borel, he gave the subject mathematical substance by proving the mini-max theorem. This asserts that for every finite, two-person zero-sum game, there is a rational outcome in the sense that two perfectly logical adversaries can arrive at a mutual choice of game strategies, confident that they could not expect to do better by choosing another strategy. (See also game theory: The von Neumann–Morgenstern theory.) In games like poker, the optimal strategy incorporates a chance element. Poker players must bluff occasionally—and unpredictably—in order to avoid exploitation by a savvier player.
mental contribution to a fourth. Claude Shannon solved the fundamental problem of making information reliable. Alan Turing demonstrated and defined the universality of com-putation and was influenced by an early lecture by von Neumann. Building on Turing and Shannon, von Neumann created the von Neumann machine, which became—and
31 de out. de 2022 · Introduction. This article concerns the history of philosophy and of logic, in particular the penetration of certain logico-philosophical ideas into computing. We demonstrate the profound impact that those migrating ideas had on the development of the modern computer—and so, ultimately, upon philosophy itself.
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.
