Turing programming language
lenguaje de Turing · lenguaje de programación de Turing
Turing language oor Spaans
Turing language
Vertalings in die woordeboek Engels - Spaans
lenguaje de Turing
lenguaje de programación de Turing
Geskatte vertalings
Vertoon algoritmies gegenereerde vertalings
Soortgelyke frases
voorbeelde
Advanced filtering
Voorbeelde moet herlaai word.
Therefore, whenever an ambiguity is possible, the synonym for "recursive language" used is Turing-decidable language, rather than simply decidable.
contrato de transporte: un contrato de servicios de transporte aéreo, o que incluye dichos servicios, también cuando el transporte se compone de dos o más vuelos operados por la misma o por diversas compañías aéreasWikiMatrix WikiMatrix
This makes TeX a Turing-complete language even at the expansion level.
¿ Porque quiero estar con mi hijo luego de tres años sin verlo?WikiMatrix WikiMatrix
He showed that with a few simple operators and a notation for functions, one can build a Turing-complete language for algorithms.
Echemos al ejercito de Estados unidos!WikiMatrix WikiMatrix
P′′ was the first "GOTO-less" imperative structured programming language to be proven Turing-complete The Brainfuck language (apart from its I/O commands) is a minor informal variation of P′′.
¡ Oh mi Dios!Santo Cielo, ¿ cómo pudiste hacerme esto? ¡ Me traicionaste!WikiMatrix WikiMatrix
Flowers too had a hand in this new, highly secret project at Hanslope.35 He and Turing spoke each other’s language.
Las autoridades nacionales competentes deben abonar a los beneficiarios los pagos previstos dentro de los regímenes comunitarios de ayuda íntegramente, sin perjuicio de las reducciones que se establezcan en el presente Reglamento, y en los plazos fijadosLiterature Literature
✦ Rice's Theorem : Any nontrivial property of the languages accepted by Turing machines is undecidable.
El escudo calló!Literature Literature
Using the language of a Turing machine, that question can have a definite answer, measured in bits.
No tan cuadrado pero mas impredecible mezclar las partesLiterature Literature
That means that it can accommodate any other language that is Turing complete.
Están tirando piedras a un giganteLiterature Literature
Theorem 13.3: A language L is recognizable by a Turing machine M if and only if L is a type 0 language.
Hola.- ¿ Eres nuestro enfermero?Literature Literature
Naturally he picks the language of a universal Turing machine.
Por que estaria enojada con usted, Freddie Christopher Prune?Literature Literature
When your language is nowhere near Turing-complete, syntactic sugar can be your friend.
Sólo eres un empleado aquíLiterature Literature
Grammars and Turing Machines Turing machines may be used to recognize languages.
La recuerda, ¿ verdad?Literature Literature
Special cases include the undecidability of whether a Turing machine accepts a particular string, whether a Turing machine recognizes a particular recognizable language, and whether the language recognized by a Turing machine could be recognized by a nontrivial simpler machine, such as a finite automaton.
Calendario indicativo para la firma de los contratos: entre marzo y julioWikiMatrix WikiMatrix
By a straightforward reduction to the halting problem, it is possible to prove that (for any Turing complete language), finding all possible run-time errors in an arbitrary program (or more generally any kind of violation of a specification on the final result of a program) is undecidable: there is no mechanical method that can always answer truthfully whether an arbitrary program may or may not exhibit runtime errors.
Parece muy decenteWikiMatrix WikiMatrix
Introduced P′′, the first imperative language without GOTO to be proved Turing-complete.
Pista de auditoríaWikiMatrix WikiMatrix
For example one may speak of languages decidable on a non-deterministic Turing machine.
No permitiré que sucedaWikiMatrix WikiMatrix
They generate exactly all languages that can be recognized by a Turing machine.
EMA/AD/#: Administrador (científico), Gestión de datos de productos (ADWikiMatrix WikiMatrix
Does luxury of language belong with excessive wealth, wasteful expendi ture, total loss?
¡ Oh, que lindo eres!Literature Literature
Loops and conditional branching were possible, and so the language as conceived would have been Turing-complete as later defined by Alan Turing.
Él lo mencionóWikiMatrix WikiMatrix
A universal Turing machine can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language.
Quero decir sin tiempo literalmenteWikiMatrix WikiMatrix
Turing was encoding his machines just as Gödel had encoded the language of symbolic logic.
Prácticas idóneas para la interpretación de criteriosLiterature Literature
Computationally, a context-sensitive language is equivalent with a linear bounded nondeterministic Turing machine, also called a linear bounded automaton.
Está en la frontera de una nueva cienciaWikiMatrix WikiMatrix
Since a Befunge-93 program can only have a single stack and its storage array is bounded, the Befunge-93 language is not Turing-complete (however, it has been shown that Befunge-93 is Turing Complete with unbounded stack word size).
Aquí están nuestros propios mosqueterosWikiMatrix WikiMatrix
Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses.
Pues yo soy tan corriente y moliente como tu, idiotaWikiMatrix WikiMatrix
Note that this is different from the recursive languages, which can be decided by an always-halting Turing machine.
¡ Habladles de algo vos también!WikiMatrix WikiMatrix
120 sinne gevind in 18 ms. Hulle kom uit baie bronne en word nie nagegaan nie.