Examples of using
Turing machine
in English and their translations into Danish
{-}
Colloquial
Official
Medicine
Financial
Ecclesiastic
Official/political
Computer
A Turing Machine in Paris in May 2016.
En Turing-maskine i Paris i maj 2016.
He had proved in his 1936 paper that a universal Turing machine existed.
Han havde vist i sin 1936 papir, at en universel Turing maskinen fandtes.
I learnt about Turing machines and Gödel 's theorem….
Jeg hørte om Turing maskiner og Gödel's sætning….
Turing was elected a Fellow of the Royal Society of London in 1951,mainly for his work on Turing machines in 1936.
Turing blev valgt som fellow i Royal Society of London i 1951,hovedsagelig for hans arbejde med Turing-maskiner i 1936.
A Turmite is a Turing Machine that operates in two dimensions.
En Turmite er en Turing-maskine, der opererer i to dimensioner.
This was the year that Shannon published a paper showing that a universal Turing machine may be constructed with only two states.
Det var det år, at Shannon offentliggjort et papir, der viser, at en universel Turing maskinen kan konstrueres med kun to stater.
A Turing machine is a theoretical construct from computer science;
En Turing-maskine er en teoretisk konstruktion fra datalogi;
He is well known for the Halting problem, Turing machines, crypto-analysis of Enigma& Turing test.
Han er kendt for Stop problemet, Turing maskiner, krypto-analyse af Enigma& Turing-test.
The Turing machine could write a symbol on the tape, or delete a symbol from the tape.
De Turing maskinen kunne skrive et symbol på båndet eller slette et symbol fra båndet.
He readily decided to make a DNA computer similar to a Turing machine with an enzyme replacing the finite control.
Han let besluttet at gøre en DNA-computer ligner en Turing-maskine med et enzym til erstatning af finite kontrol.
A Turing machine is a theoretical construct from computer science; it's a machine that reads and writes symbols from a tape according to very simple rules.
En Turing-maskine er en teoretisk konstruktion fra datalogi; Det er en maskine, der læser og skriver symboler fra et bånd efter meget enkle regler.
Jan 15 in Screensavers Mac read more Sponsored Links:Turmites 1.0.0 A Turmite is a Turing Machine that operates in two dimensions.
Jan 15 I Screensavers Mac Læs mere Sponsorerede links:Turmites 1.0.0 En Turmite er en Turing-maskine, der opererer i to dimensioner.
In other words,one could program a Turing machine to produce Watson-Crick complementary strings, factor numbers, play chess and so on.
Med andre ord,man kunne programmere en Turing-maskine til at producere Watson-Crick komplementære strenge, faktor numre, spille skak og så videre.
He defined a computable number as real number whose decimal expansion could be produced by a Turing machine starting with a blank tape.
Han definerede en beregnelige nummer som reelt tal, hvis decimal ekspansion kunne produceres af en Turing maskinen starter med et tomt bånd.
Visual Turing Machine project is a program that lets you create Turing machines with a point and click interface instead of using esoteric languages.
Visual Turing Machine-projektet er et program, der lader dig oprette Turing-maskiner med en peg og klik-interface i stedet for at bruge esoteriske sprog.
Recursion theory, computable functions on the natural numbers, Turing machines, recursively enumerable sets and Turing degrees.
Rekursionsteori, Beregnelige funktioner på de naturlige tal, Turing maskiner, rekursivt numerable mængder og Turing grader.
In fact his interest in the theory of computation went back to his days as a graduate student in Münster when he attended a series of lectures on Turing machines.
I virkeligheden hans interesse i teorien om beregning gik tilbage til hans dage som en akademisk grad i Münster, da han deltog i en række forelæsninger om Turing maskiner.
With co-workers L Blum and M Shub,he has developed a model of computation which includes both the Turing machine approach and the numerical methods of numerical analysis.
Med co-arbejdere L Blum og M Shub,har han udviklet en model for beregning, som omfatter både Turing maskinen tilgang og de numeriske metoder til numerisk analyse.
It is impossible to decide(using another Turing machine) whether a Turing machine with a given table of instructions will output an infinite sequence of numbers.
Det er umuligt at afgøre(ved hjælp af en anden Turing maskine), om en Turing maskine med en given tabel af instruktioner, vil outputtet en uendelig sekvens af tal.
Although to Turing a"computer" was a person who carried out a computation,we must see in his description of a universal Turing machine what we today think of as a computer with the tape as the program.
Skønt at Turing en"computer" var en person der foretaget en beregning,må vi se i hans beskrivelse af en universel Turing maskinen, hvad vi i dag tænker på som en computer med tape som programmet.
He is well known for the Halting problem, Turing machines, crypto-analysis of Enigma& Turing test.Turing award is given annually for exceptional work in the field of computing.
Han er kendt for Stop problemet, Turing maskiner, krypto-analyse af Enigma& Turing-test. Turing Prisen gives hvert år for fremragende arbejde inden for computing.
The model of computation developed in the following decades, the Turing machine, has been extraordinarily successful in giving the foundations and framework for theoretical computer science.
Den model for beregning udvikles i de følgende årtier, Turing maskinen, har været usædvanlig succesfuld i at give grundlaget og rammerne for teoretisk datalogi.
Undecidability involves the halting problem for Turing machines and in 1991, when Robinson was aged 80,he published Minsky's small universal Turing machine which describes a universal Turing machine with 4 symbols and 7 states.
Undecidability indebærer standse problem for Turing-maskiner og i 1991, hvor Robinson blev i alderen 80,han offentliggjorde Minsky's små universelle Turing-maskine, der beskriver en universel Turing-maskine med 4 symboler og 7 stater.
He worked on logic and theoretical computer science, particularly Turing machines, publishing On non-computable functions in 1962 andComputer studies of Turing machine problems in 1965.
Han arbejdede på logik og teoretisk datalogi, især Turing-maskiner, udgivelse på ikke-beregnelige funktioner i 1962 ogComputer undersøgelser af Turing maskinen problemer i 1965.
He had proved in his 1936 paper that a universal Turing machine existed:… which can be made to do the work of any special-purpose machine, that is to say to carry out any piece of computing, if a tape bearing suitable"instructions" is inserted into it.
Han havde vist i sin 1936 papir, at en universel Turing maskinen fandtes:… der kan gøres for at gøre arbejdet i nogen særlige formue maskine, det vil sige at udføre enhver form for databehandling, hvis et bånd er forsynet med egnede"instruktioner" er indsat i det.
When these definitions were shown equivalent to Turing's formalization involving Turing machines, it became clear that a new concept- the computable function- had been discovered, and that this definition was robust enough to admit numerous independent characterizations.
Da disse definitioner blev vist at være ækvivalente med Turings formalisering, involverende Turing-maskiner, blev det klart at et nyt begreb- den beregnelige funktion- var blevet opdaget, og at denne definition var tilstrækkelig robust til at tillade adskillige, uafhængige karakteristiker.
Jun 15 in Educational& Science Software,Math Software Linux read more Visual Turing Machine 2.0 Visual Turing Machine project is a program that lets you create Turing machines with a point and click interface instead of using esoteric languages. You can pack your complex machines into small boxes, and then reuse them as part of a bigger machine..
Jun 15 I Uddannelsesmæssige og videnskab software,Matematik software Linux Læs mere Visual Turing Machine 2.0 Visual Turing Machine-projektet er et program, der lader dig oprette Turing-maskiner med en peg og klik-interface i stedet for at bruge esoteriske sprog. Du kan pakke dine komplekse maskiner i små kasser, og derefter genbruge dem som en del af en større.
Results: 27,
Time: 0.0453
How to use "turing machine" in an English sentence
Computational scheme, equivalence, and Turing machine are defined.
Turing machine equivalents Shawn-Douglas Brady Warren Stevens St.
My universal turing machine is some how "cheap".
However,iterating them will actually generated Turing machine computations!
We can assign each Turing machine a number.
Fast algorithms - a multitape Turing machine implementation.
Developer of the Turing Machine and Turing Test.
Alan Turing created the Turing machine around 1935.
A Turing Machine leads off this week's soundtrack.
Everything about this Turing machine is absolutely brilliant.
Dansk
Deutsch
Español
Suomi
Français
Norsk
عربى
Български
বাংলা
Český
Ελληνικά
עִברִית
हिंदी
Hrvatski
Magyar
Bahasa indonesia
Italiano
日本語
Қазақ
한국어
മലയാളം
मराठी
Bahasa malay
Nederlands
Polski
Português
Română
Русский
Slovenský
Slovenski
Српски
Svenska
தமிழ்
తెలుగు
ไทย
Tagalog
Turkce
Українська
اردو
Tiếng việt
中文