ЧТО ОЗНАЧАЕТ СЛОВО TURING MACHINE
Машина Тьюринга
Машина Тьюринга является гипотетическим устройством, которое манипулирует символами на ленте ленты в соответствии с таблицей правил. Несмотря на свою простоту, машина Тьюринга может быть адаптирована для имитации логики любого компьютерного алгоритма и особенно полезна для объяснения функций центрального процессора внутри компьютера. Машина «Тьюринга» была изобретена в 1936 году Аланом Тьюрингом, который назвал ее «а-машиной». Машина Тьюринга не предназначена как практическая вычислительная техника, а скорее как гипотетическое устройство, представляющее вычислительную машину. Машины Тьюринга помогают компьютерным ученым понять пределы механических вычислений. Тьюринг дал краткое определение эксперимента в своем эссе 1948 года «Интеллектуальная техника». Ссылаясь на свою публикацию 1936 года, Тьюринг писал, что машина Тьюринга, называемая здесь логической вычислительной машиной, состояла из: ... неограниченной емкости памяти, полученной в виде бесконечной ленты, выделенной на квадраты, на каждом из которых символ мог печататься. В любой момент в машине есть один символ; он называется отсканированным символом.
Значение слова Turing machine в словаре английский языка
Определение машины Тьюринга в словаре - гипотетическая универсальная вычислительная машина, способная модифицировать свои первоначальные инструкции путем чтения, стирания или записи нового символа на движущейся ленте фиксированной длины, которая действует как ее программа. Эта концепция сыграла важную роль в раннем развитии компьютерных систем.
КНИГИ НА АНГЛИЙСКИЙ ЯЗЫКЕ, ИМЕЮЩЕЕ ОТНОШЕНИЕ К СЛОВУ «TURING MACHINE»
Поиск случаев использования слова
Turing machine в следующих библиографических источниках. Книги, относящиеся к слову
Turing machine, и краткие выдержки из этих книг для получения представления о контексте использования этого слова в литературе на английский языке.
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 .
НОВОСТИ, В КОТОРЫХ ВСТРЕЧАЕТСЯ ТЕРМИН «TURING MACHINE»
Здесь показано, как национальная и международная пресса использует термин
Turing machine в контексте приведенных ниже новостных статей.
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, Фев 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, Фев 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, Янв 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, Янв 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, Янв 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, Дек 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, Дек 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, Дек 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, Ноя 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, Ноя 14»