| slovo | definícia |
neumann
(encz) | Neumann,Neumann n: [jmén.] |
neumann
(encz) | Neumann,Neumann n: [jmén.] příjmení Zdeněk Brož a automatický překlad |
neumann
(czen) | Neumann,Neumannn: [jmén.] |
neumann
(czen) | Neumann,Neumannn: [jmén.] příjmení Zdeněk Brož a automatický překlad |
neumann
(wn) | Neumann
n 1: United States mathematician who contributed to the
development of atom bombs and of stored-program digital
computers (1903-1957) [syn: von Neumann, Neumann, {John
von Neumann}] |
| | podobné slovo | definícia |
neumann
(encz) | Neumann,Neumann n: [jmén.] Neumann,Neumann n: [jmén.] příjmení Zdeněk Brož a automatický překlad |
von neumann
(encz) | von Neumann, n: |
von neumann machine
(encz) | von Neumann machine, n: |
neumann
(czen) | Neumann,Neumannn: [jmén.] Neumann,Neumannn: [jmén.] příjmení Zdeněk Brož a automatický překlad |
john von neumann
(wn) | John von Neumann
n 1: United States mathematician who contributed to the
development of atom bombs and of stored-program digital
computers (1903-1957) [syn: von Neumann, Neumann, {John
von Neumann}] |
neumann
(wn) | Neumann
n 1: United States mathematician who contributed to the
development of atom bombs and of stored-program digital
computers (1903-1957) [syn: von Neumann, Neumann, {John
von Neumann}] |
otto neumann sverdrup
(wn) | Otto Neumann Sverdrup
n 1: Norwegian explorer who led expeditions into the Arctic
(1855-1930) [syn: Sverdrup, Otto Neumann Sverdrup] |
von neumann
(wn) | von Neumann
n 1: United States mathematician who contributed to the
development of atom bombs and of stored-program digital
computers (1903-1957) [syn: von Neumann, Neumann, {John
von Neumann}] |
von neumann machine
(wn) | von Neumann machine
n 1: any digital computer incorporating the ideas of stored
programs and serial counters that were proposed in 1946 by
von Neumann and his colleagues |
john von neumann
(foldoc) | John von Neumann
von Neumann, John
/jon von noy'mahn/ Born 1903-12-28, died 1957-02-08.
A Hungarian-born mathematician who did pioneering work in
quantum physics, game theory, and computer science. He
contributed to the USA's Manhattan Project that built the
first atomic bomb.
von Neumann was invited to Princeton University in 1930, and
was a mathematics professor at the {Institute for Advanced
Studies} from its formation in 1933 until his death.
From 1936 to 1938 Alan Turing was a visitor at the Institute
and completed a Ph.D. dissertation under von Neumann's
supervision. This visit occurred shortly after Turing's
publication of his 1934 paper "On Computable Numbers with an
Application to the Entscheidungs-problem" which involved the
concepts of logical design and the universal machine. von
Neumann must have known of Turing's ideas but it is not clear
whether he applied them to the design of the IAS Machine ten
years later.
While serving on the BRL Scientific Advisory Committee, von
Neumann joined the developers of ENIAC and made some
critical contributions. In 1947, while working on the design
for the successor machine, EDVAC, von Neumann realized that
ENIAC's lack of a centralized control unit could be overcome
to obtain a rudimentary stored program computer. He also
proposed the fetch-execute cycle. His ideas led to what is
now often called the von Neumann architecture.
(http://sis.pitt.edu/~mbsclass/is2000/hall_of_fame/vonneuma.htm).
(http://ei.cs.vt.edu/~history/VonNeumann.html).
(http://ftp.arl.mil/~mike/comphist/54nord/).
(2004-01-14)
|
von neumann architecture
(foldoc) | von Neumann architecture
von Neumann machine
A computer architecture
conceived by mathematician John von Neumann, which forms the
core of nearly every computer system in use today (regardless
of size). In contrast to a Turing machine, a von Neumann
machine has a random-access memory (RAM) which means that
each successive operation can read or write any memory
location, independent of the location accessed by the previous
operation.
A von Neumann machine also has a central processing unit
(CPU) with one or more registers that hold data that are
being operated on. The CPU has a set of built-in operations
(its instruction set) that is far richer than with the
Turing machine, e.g. adding two binary integers, or
branching to another part of a program if the binary integer
in some register is equal to zero (conditional branch).
The CPU can interpret the contents of memory either as
instructions or as data according to the {fetch-execute
cycle}.
Von Neumann considered parallel computers but recognized the
problems of construction and hence settled for a sequential
system. For this reason, parallel computers are sometimes
referred to as non-von Neumann architectures.
A von Neumann machine can compute the same class of functions
as a universal Turing machine.
[Reference? Was von Neumann's design, unlike Turing's,
originally intended for physical implementation?]
(http://salem.mass.edu/~tevans/VonNeuma.htm).
(2003-05-16)
|
von neumann integer
(foldoc) | von Neumann integer
A finite von Neumann ordinal.
The von Neumann integer N is a finite set with N elements
which are the von Neumann integers 0 to N-1. Thus
0 = {} = {}
1 = 0 = {}
2 = 0, 1 = {, {}}
3 = 0, 1, 2 = {, {}, {, {}}}
...
The set of von Neumann integers is infinite, even though
each of its elements is finite.
[Origin of name?]
(1995-03-30)
|
von neumann machine
(foldoc) | von Neumann architecture
von Neumann machine
A computer architecture
conceived by mathematician John von Neumann, which forms the
core of nearly every computer system in use today (regardless
of size). In contrast to a Turing machine, a von Neumann
machine has a random-access memory (RAM) which means that
each successive operation can read or write any memory
location, independent of the location accessed by the previous
operation.
A von Neumann machine also has a central processing unit
(CPU) with one or more registers that hold data that are
being operated on. The CPU has a set of built-in operations
(its instruction set) that is far richer than with the
Turing machine, e.g. adding two binary integers, or
branching to another part of a program if the binary integer
in some register is equal to zero (conditional branch).
The CPU can interpret the contents of memory either as
instructions or as data according to the {fetch-execute
cycle}.
Von Neumann considered parallel computers but recognized the
problems of construction and hence settled for a sequential
system. For this reason, parallel computers are sometimes
referred to as non-von Neumann architectures.
A von Neumann machine can compute the same class of functions
as a universal Turing machine.
[Reference? Was von Neumann's design, unlike Turing's,
originally intended for physical implementation?]
(http://salem.mass.edu/~tevans/VonNeuma.htm).
(2003-05-16)
|
von neumann ordinal
(foldoc) | von Neumann ordinal
An implementation of ordinals in set theory
(e.g. Zermelo Fränkel set theory or ZFC). The von Neumann
ordinal alpha is the well-ordered set containing just the
ordinals "shorter" than alpha.
"Reasonable" set theories (like ZF) include Mostowski's
Collapsing Theorem: any well-ordered set is isomorphic to
a von Neumann ordinal. In really screwy theories (e.g. NFU --
New Foundations with Urelemente) this theorem is false.
The finite von Neumann ordinals are the {von Neumann
integers}.
(1995-03-30)
|
von neumann, john
(foldoc) | John von Neumann
von Neumann, John
/jon von noy'mahn/ Born 1903-12-28, died 1957-02-08.
A Hungarian-born mathematician who did pioneering work in
quantum physics, game theory, and computer science. He
contributed to the USA's Manhattan Project that built the
first atomic bomb.
von Neumann was invited to Princeton University in 1930, and
was a mathematics professor at the {Institute for Advanced
Studies} from its formation in 1933 until his death.
From 1936 to 1938 Alan Turing was a visitor at the Institute
and completed a Ph.D. dissertation under von Neumann's
supervision. This visit occurred shortly after Turing's
publication of his 1934 paper "On Computable Numbers with an
Application to the Entscheidungs-problem" which involved the
concepts of logical design and the universal machine. von
Neumann must have known of Turing's ideas but it is not clear
whether he applied them to the design of the IAS Machine ten
years later.
While serving on the BRL Scientific Advisory Committee, von
Neumann joined the developers of ENIAC and made some
critical contributions. In 1947, while working on the design
for the successor machine, EDVAC, von Neumann realized that
ENIAC's lack of a centralized control unit could be overcome
to obtain a rudimentary stored program computer. He also
proposed the fetch-execute cycle. His ideas led to what is
now often called the von Neumann architecture.
(http://sis.pitt.edu/~mbsclass/is2000/hall_of_fame/vonneuma.htm).
(http://ei.cs.vt.edu/~history/VonNeumann.html).
(http://ftp.arl.mil/~mike/comphist/54nord/).
(2004-01-14)
|
|