home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Loadstar 233
/
233.d81
/
m.5
< prev
next >
Wrap
Text File
|
2022-08-26
|
2KB
|
89 lines
u<m1>
<c10>
<c41>
<c51>
<t0>
Probably the single greatest mind
dedicated to the development of
computers belonged to Alan Turing.
During the World War II he was a
major participant in the efforts at
Bletchley Park on cracking Nazi
cyphers. He contributed several
mathematical insights to breaking the
Enigma cypher. Turing's work on
breaking the Enigma cypher was kept
secret until the 1970s; not even his
close friends knew about it.
\
\
<c12>
Press Key
<c10>
<w>
<c10>
<c41>
<c51>
<t0>
Turing proposed the idea of a
universal machine. The concept of the
Turing machine is based on the idea of
a person executing a well-defined
procedure by changing the contents of
an infinite amount of ordered paper
sheets that can contain one of a
finite set of symbols. The person
needs to remember one of a finite set
of states and the procedure is
formulated in very basic steps in the
form of "If your state is 42 and the
symbol you see is a '0' then replace
this with a '1', change the state to
17, and go to the following sheet."
Such a machine could emulate any
other machine -- hence "universal."
<c12>
Press Key
<c10>
<w>
<t0>
Any computer or computer language is
said to be Turing-Complete if it can
emulate the Turing Machine. The only
caveat is that Turing posited infinite
memory and no machine today has truly
infinite memory.
The Turing Machine is not to be
confused with the Turing Test -- a
logical, result-determined means of
determining if a machine has achieved
Artificial Intelligence. In the Turing
Test a human judge engages in a
natural language conversation with two
other parties, one a human and the
other a machine. If the judge cannot
reliably tell which is which, then the
machine is said to pass the test.
<c12>
\
Press Key
<c10>
<w>
<d5>
<t3>
1912 - 1954
Press Key to go to next story
<w>
<q1>
<l3m.6>
<s3>