Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
turing test - traduction vers arabe
turing test
إختبار تورنج .
Turing machine
![A Turing machine realization using [[Lego]] pieces](https://commons.wikimedia.org/wiki/Special:FilePath/Lego Turing Machine.jpg?width=200 "A Turing machine realization using [[Lego]] pieces")
![finite-state representation]]. Each circle represents a "state" of the table—an "m-configuration" or "instruction". "Direction" of a state ''transition'' is shown by an arrow. The label (e.g. ''0/P,R'') near the outgoing state (at the "tail" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. ''0'') followed by a slash ''/'', followed by the subsequent "behaviors" of the machine, e.g. "''P'' ''print''" then move tape "''R'' ''right''". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1967), Hill, and Peterson (1974).](https://commons.wikimedia.org/wiki/Special:FilePath/State diagram 3 state busy beaver 2B.svg?width=200 "finite-state representation]]. Each circle represents a \"state\" of the table—an \"m-configuration\" or \"instruction\". \"Direction\" of a state ''transition'' is shown by an arrow. The label (e.g. ''0/P,R'') near the outgoing state (at the \"tail\" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. ''0'') followed by a slash ''/'', followed by the subsequent \"behaviors\" of the machine, e.g. \"''P'' ''print''\" then move tape \"''R'' ''right''\". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1967), Hill, and Peterson (1974).")
ABSTRACT COMPUTATION MODEL; MATHEMATICAL MODEL OF COMPUTATION THAT DEFINES AN ABSTRACT MACHINE WHICH MANIPULATES SYMBOLS ON A STRIP OF TAPE ACCORDING TO A TABLE OF RULES
Turing Machine; Turing Machine simulator; Universal computation; Turing machines; Deterministic Turing machine; Universal computer; K-string Turing machine with input and output; Turing Machines; The Turing Machine; Universal computing machine; Turing-computable function; Turing table; A-machine
اّلة تورنج
indirect antiglobulin test
.png?width=200 "date=2017-02-27}} Citing: C Feldman & J O'Connor.</ref>")
BLOOD TEST USED IN IMMUNOHEMATOLOGY
Coombs antibody; Direct antiglobulin test; Coombs reagent; Coombs' test; Indirect Coombs' test; Coomb's test; Antiglobulin test; Indirect Coombs test; Direct coombs test; Direct Coombs test; Direct Coomb’s test; Coomb test; Anti Human Globulin; Indirect antiglobulin test
اخْتِبارُ ضُدِّ الغُلوبولين اللَّامُباشِر
Définition
Turing test
¦ noun a series of questions used as a test for intelligence in a computer.
Wikipédia
Turing test
The Turing test, originally called the imitation game by Alan Turing in 1950, is a test of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human. Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses.
Exemples du corpus de texte pour turing test
1. This is the so–called Turing test, devised in the 1'50s by the computer scientist Alan Turing.
2. They will pass the Turing Test in the 2020s, in which humans will not be able to tell whether they are conversing with a person or a computer.
3. The final criterion for any such reproduction is the rather imprecise "Turing test" of artificial intelligence÷ that is, whether it can make the listener think he or she is hearing a person rather than a machine. 1 2 3Next>> Next Article in Arts (1 of 18) >
4. "A lot of cutting edge AI has filtered into general applications, often without being called AI because once something becomes useful enough and common enough it‘s not labelled AI anymore." Although AI has enjoyed its headline–grabbing moments, such as when IBM‘s Deep Blue computer beat chess world champion Garry Kasparov in 1''7, no machine has yet come close to passing the "Turing Test" –– the conversational test devised by mathematician Alan Turing in 1'50 to determine whether a machine could "think." But Bostrom said that traditional "top–down" approaches to AI, in which programmers coded machined to cope with specific situations, were being supplemented by "bottom–up" systems inspired by enhanced understanding of the neural networks of the brain, leading to more subtle forms of AI.