CE ÎNSEAMNĂ TURING MACHINE ÎN ENGLEZĂ?
Mașină Turing
O mașină Turing este un dispozitiv ipotetic care manipulează simbolurile pe o bandă de bandă conform unui tabel de reguli. În ciuda simplității sale, o mașină Turing poate fi adaptată pentru a simula logica oricărui algoritm de calculator și este utilă în special în explicarea funcțiilor unui CPU în interiorul unui computer. Mașina "Turing" a fost inventată în 1936 de către Alan Turing, care la numit "o mașină". Mașina Turing nu este concepută ca tehnologie de calcul practică, ci mai degrabă ca un dispozitiv ipotetic reprezentând o mașină de calcul. Mașinile Turing ajută oamenii de știință să înțeleagă limitele calculului mecanic. Turing a dat o definiție succintă a experimentului în eseul său din 1948, "Intelligent Machinery". Referindu-se la publicatia sa din 1936, Turing a scris ca masina Turing, numita aici Masina computerizata logica, consta in: ... o capacitate de memorie nelimitata obtinuta sub forma unei benzi infinite marcate in patrate, pe fiecare dintre acestea un simbol fi imprimat. În orice moment există un simbol în mașină; se numește simbolul scanat.
Definiția Turing machine în dicționarul Engleză
Definiția mașinii Turing în dicționar este o mașină ipotetică de calcul universal capabilă să-și modifice instrucțiunile originale prin citirea, ștergerea sau scrierea unui nou simbol pe o bandă în mișcare de lungime fixă care acționează ca program. Conceptul a fost esențial pentru dezvoltarea timpurie a sistemelor informatice.
CĂRȚI ÎN ENGLEZĂ ÎN LEGĂTURĂ CU «TURING MACHINE»
Descoperă întrebuințarea
Turing machine în următoarea selecție bibliografică. Cărți în legătură cu
Turing machine și extrase din aceasta pentru a furniza contextul de întrebuințare al acestuia în literatura Engleză.
1
The Universal
Turing Machine: A Half-Century Survey
This volume recognizes the still continuing influence of the Turing machine concept by collecting contributions from international specialists in logic, computability, mathematics, biology, physics, linguistics, and cognitive science, thus ...
2
Computability and Complexity Theory
Substantial new content in this edition includes:a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa ...
Steven Homer, Alan L. Selman,
2011
3
Alan
Turing: Life and Legacy of a Great Thinker
This book is the definitive collection of commemorative essays, and the distinguished contributors have expertise in such diverse fields as artificial intelligence, natural computing, mathematics, physics, cryptology, cognitive studies, ...
4
Taking God Out of Mathematics and Putting the Body Back in: ...
“Rotman uses semiotics to focus on the infinite and the meaning of the mathematician’s ellipsis. . . . He argues persuasively that a constructive model of the infinite is inherent in the literary acts of mathematicians.”—Choice
5
The annotated
Turing: a guided tour through Alan
Turing's ...
This absorbing book expands Turing's now legendary 36-page paper with extensive annotations, fascinating historical context, and page-turning glimpses into his private life.
6
Turing Machines with Sublogarithmic Space
More precisely, we shall try to find out how much space is needed for the
deterministic Turing machine to accept the language which is accepted by a
nondeterministic Turing machine in L(n) space. We present the famous result of
Savitch ...
Andrzej Szepietowski,
1994
7
Computability, Complexity, and Languages: Fundamentals of ...
For each of the following functions, construct a Turing machine that computes the
function strictly. (a) f(u,v) = uv. (b) P(x) =» x has an even number of symbols. (c) f(
x) given in Exercise 1.4 in Chapter 5. (d) f(x) = xR. [xR is defined in Chapter 1, ...
Martin Davis, Ron Sigal, Elaine J. Weyuker,
1994
8
Quantum Computation and Quantum Information: 10th ...
This machine computes a function f(x), where f(x) is defined to be the contents of
the first tape after the Turing machine has halted. Rather remarkably, it turns out
that given a two-tape Turing machine to compute f, there exists an equivalent ...
Michael A. Nielsen, Isaac L. Chuang,
2010
9
Alan
Turing: His Work and Impact: His Work and Impact
This collection provides a great service to researchers, but is also an approachable entry point for readers with limited training in the science, but an urge to learn more about the details of Turing's work. 2013 winner of the prestigious ...
S. Barry Cooper, J. van Leeuwen,
2013
10
An Introduction to Formal Languages and Automata
214 Some Decidable Properties of Context-Free Languages . 218 9 Turing
Machines 223 9.1 The Standard Turing Machine . . . . . . . . . . . . . . . . . 224
Definition of a Turing Machine . . . . . . . . . . . . . . 224 Turing Machines as Language
Accepters .
ȘTIRI NOI CARE INCLUD TERMENUL «TURING MACHINE»
Află ce ziare naționale și internaționale au scris despre și cum este întrebuințat termenul
Turing machine în contextul următoarelor știri.
Rare Alan Turing journal shows his genius at work
His so-called Turing machine concept became the basis of the digital computer. Now the public is getting a glimpse of his mathematical brilliance at work. «CNET, Feb 15»
Campaign to buy Alan Turing's notebook for the nation
Benedict Cumberbatch as Alan Turing in the Oscar-nominated Imitation Game. ... His invention of the Universal Turing machine played midwife to the birth of the ... «The Guardian, Feb 15»
Turing manuscript going up for auction
Alan Turing, the mathematician credited with inventing one of the first computers which was ... There was a time that computers were known as Turing machines. «CNNMoney, Ian 15»
The Imitation Game: is it history, drama or myth?
It makes brief references to Turing's theoretical model of a computer – the universal Turing machine in 1936 – and his work on machine intelligence in 1950. «The Conversation AU, Ian 15»
Setting The Record Straight For Alan Turing
In 1935, at the ripe age of 22, Turing devised the abstract mathematical background to define a computing machine. Now called a "Turing Machine," it would ... «NPR, Ian 15»
The Imitation Game: “Am I a machine? Am I a war hero? Am I a …
Turing's conception “became known immediately as 'the Turing machine' but now it is impossible not to see Turing machines as computer programs, or software. «World Socialist Web Site, Dec 14»
'Imitation Game' honors my hero, Alan Turing, world-changer …
Through the “Turing machine,” as this device came to be called, Alan Turing gave us the gift of universality. Of software. All the other computer buffs of the time ... «UC Berkeley, Dec 14»
Alan Turing's Biographer On The Truth About The Troubled Genius …
The movie spotlights Turing's work as a codebreaker during World War II. ... idea of the universal Turing machine," Hodges says in a recent interview with The ... «Huffington Post, Dec 14»
'Imitation Game' needed to imitate Alan Turing's code-breaking …
The film's Turing machine is a mass of whirling dials, buttons and chunky red wires that resemble Medusa's hair. The design is derived from the real Christopher, ... «Los Angeles Times, Nov 14»
The Imitation Game: inventing a new slander to insult Alan Turing
Turing builds an Enigma-code-cracking machine, which he calls Christopher. ... digital computer Turing invented was known as the Universal Turing Machine. «The Guardian, Nov 14»