What is the translation of " TURINGOV STROJ " in English?

• turing machine

Examples of using Turingov stroj in Slovenian and their translations into English

Turingov stroj je model zaporednega računanja.
Turing machine as a computation model.

Podal je vplivno formulacijo koncepta algoritma in računanja imenovano po njem- Turingov stroj.
He provided an influential formalisation of the concept of algorithm and computation: the Turing machine.

Vsak turingov stroj lahko izvede vse, kar znajo danasnji racunalniki.
Turing's machine can, in theory, perform any computation being done today by any computer.

V knjigi je trdil da je našel najpreprostejši znani univerzalni Turingov stroj z 2. stanjima in 5.
In this book, Wolfram found the simplest known Universal Turing Machine, one with two states and five symbols.

Turingov stroj, ki je sposoben simulirati druge Turingove stroje, se imenuje splošni Turingov stroj ali kar splošni stroj, kakor je opisal Turing leta 1947:.
A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine or simply a universal machine as Turing described it in 1947:.

V knjigi je trdil da je našel najpreprostejši znani univerzalni Turingov stroj z 2. stanjima in 5. barvami.
In the NKS book, I found what is currently the simplest known universal Turing machine- with 2 states and 5 colors.

Pokazal je, da bi bila lahko najpreprostejša razlaga Vesolja zelo preprost Turingov stroj, programiran za sistematično izvajanje vseh možnih programov in izračunavanje vseh možnih zgodovin vseh vrst izračunljivih fizikalnih zakonov.
He pointed out that a simple explanation of the universe would be a Turing machine programmed to execute all possible programs computing all possible histories for all types of computable physical laws.

V knjigi je trdil da je našel najpreprostejši znani univerzalni Turingov stroj z 2. stanjima in 5. barvami.
In A New Kind of Science, Wolfram claimed to have found the simplest known universal Turing machine, one with 2 states and 5 colours.

Pokazal je, da bi bila lahko najpreprostejša razlaga Vesolja zelo preprost Turingov stroj, programiran za sistematično izvajanje vseh možnih programov in izračunavanje vseh možnih zgodovin vseh vrst izračunljivih fizikalnih zakonov.
He pointed out that the simplest explanation of the universe would be a very simple Turing machine programmed to systematically execute all possible programs computing all possible histories for all types of computable physical laws.

Na tej ravni nam ni treba omenjati, kako stroj upravlja s trakom ali glavo." 2 Opis izvedbe»… proza uporabljena za določanje načina, kako Turingov stroj uporablja glavo in način shranjevanja podatkov na traku.
At this level, we do not need to mention how the machine manages its tape or head." 2 Implementation description“… prose used to define the way the Turing machine uses its head and the way that it stores data on its tape.

Takšen računalnik je lahko velik celični avtomat(Zuse, 1967) ali splošni Turingov stroj, kar je predlagal Schmidhuber(1997), ki je pokazal, da obstaja zelo kratek program, ki lahko izračuna vsa možna izračunljiva vesolja na asimptotično optimalni način.
The computer could be, for example, a huge cellular automaton(Zuse 1967), or a universal Turing machine, as suggested by Schmidhuber(1997), who pointed out that there exists a short program that can compute all possible computable universes in an asymptotically optimal way.

Primera determinističnih avtomatov sta deterministični Turingov stroj in deterministični končni avtomat.
Examples of particular abstract machines which are deterministic include the deterministic Turing machine and deterministic finite automaton.

Vpeljal je tudi izraz»Splošni stroj«(sedaj bolj znan kot splošni oz. univerzalni Turingov stroj), ki je izraz za stroj, ki lahko izvede katerokoli operacijo drugega računskega stroja, ali, z drugimi besedami, računsko operacijo ali izračun na osnovi programa, shranjenega na traku, s čimer dosežemo programabilnost naprave.
He also introduced the notion of a"universal machine"(now known as a universal Turing machine), with the idea that such a machine could perform the tasks of any other machine, or in other words, it is provably capable of computing anything that is computable by executing a program stored on tape, allowing the machine to be programmable.

Ta problem je rešljiv na determinističnem Turingovem stroju.
And the input for this deterministic Turing machine.

Turingovi stroji lahko opredelijo računske procese, ki se ne zaključujejo.
Turing machines can define computational processes that do not terminate.

Turingovi stroji so še danes osnovni predmet računske teorije.
To this day, Turing machines are a central object of study in theory of computation.

Turingovi stroji so še danes osnovni predmet računske teorije.
Turing machines are to this day a central object of study in theory of computation.

Turingovi stroji so še danes osnovni predmet računske teorije.
Turing's machines are a central object in theory of computation even to this day.

Zasnoval je tudi miselni koncept Turingovega stroja.
He developped the concept of a Turing Machine.

Predstavitve algoritmov lahko razvrstimo v tri sprejete ravni opisa Turingovega stroja, in sicer:[1].
Representations of algorithms can be classed into three accepted levels of Turing machine description, as follows:[39].

Maja 2007 je objavil nagrado v višini 25.000$ osebi ali skupini, ki bi podala formalni dokaz za univerzalnost takšnega Turingovega stroja.
On May 14, 2007, Wolfram announced a $25,000 prize to be won by the first person to prove or disprove the universality of the(2,3) Turing machine.

Leta 1936 je angleški matematik Alan Turing objavil svojo teorijo o tako imenovanem Turingovem stroju.
In 1936, Alan Turing published his paper on what became known as the Turing Machine.

Imel je velik vpliv na razvoj teoretičnega računalništva, saj je omogočil formalizacijo konceptov algoritma in računanja s Turingovim strojem, ta se lahko šteje za model splošnega računalnika.
He was highly influential in the development of computer science, giving a formalisation of the concepts of"algorithm" and"computation" with the Turing machine, which can be considered a model of a general purpose computer….

Na tej ravni ne podajamo podrobnosti o stanju ali prehodni funkciji." 3 Formalni opis Najbolj podrobni,"najnižja raven", podaja"tabelo stanja" Turingovega stroja.
At this level, we do not give details of states or transition function." 3 Formal description Most detailed,"lowest level", gives the Turing machine's"state table".

Če mu ne uspe ugotoviti, kateri je kateri, je stroj opravil Turingov test.
If the evaluator cannot tell, the machine has passed the Turing test.

Leta 1939 je Turingov sodelavec Gordon Welchman z ekipo ustvaril ogromen stroj, ki je z lahkoto dešifriral vsakdanja spročila.
In 1939, Turing, fellow codebreaker Gordon Welchman and his team created the giant machine that easily decrypted daily messages.

Lotil se je problema oz. vprašanja umetne inteligence in predlagal eksperiment, ki je kasneje postal znan kot Turingov test, želel je določiti“standard” za stroj, ki bi ga po tem standardu imenoval“inteligenten”.
In 1950 Turing addressed the problem of artificial intelligence, and proposed an experiment which became known as the Turing Test, an attempt to define a standard for a machine to be called“intelligent“.