Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
Turing test - vertaling naar Engels
Turing test
test Turing (test definito dal matematico Alan Turing idoneo a verificare la capacità di una macchina ad esaminare l"intelligenza umana)
Alan Turing
![[[King's College, Cambridge]], where Turing was an undergraduate in 1931 and became a Fellow in 1935. The computer room is named after him.](https://commons.wikimedia.org/wiki/Special:FilePath/20130808 Kings College Front Court Fountain Crop 03.jpg?width=200 "[[King's College, Cambridge]], where Turing was an undergraduate in 1931 and became a Fellow in 1935. The computer room is named after him.")
![Hampton]]](https://commons.wikimedia.org/wiki/Special:FilePath/Alan Turing 78 High Street Hampton blue plaque.jpg?width=200 "Hampton]]")
![The [[Alan Turing Building]] at the University of Manchester in 2008](https://commons.wikimedia.org/wiki/Special:FilePath/Alan Turing Building 1.jpg?width=200 "The [[Alan Turing Building]] at the University of Manchester in 2008")
![Turing's OBE currently held in [[Sherborne School]] archives](https://commons.wikimedia.org/wiki/Special:FilePath/Alan Turing OBE.jpg?width=200 "Turing's OBE currently held in [[Sherborne School]] archives")
![A working replica of a [[bombe]] now at [[The National Museum of Computing]] on Bletchley Park](https://commons.wikimedia.org/wiki/Special:FilePath/Bombe-rebuild.jpg?width=200 "A working replica of a [[bombe]] now at [[The National Museum of Computing]] on Bletchley Park")
![Turing memorial statue plaque in [[Sackville Park]], Manchester](https://commons.wikimedia.org/wiki/Special:FilePath/Sackville Park Turing plaque.jpg?width=200 "Turing memorial statue plaque in [[Sackville Park]], Manchester")
![Two cottages in the stable yard at [[Bletchley Park]]. Turing worked here in 1939 and 1940, before moving to [[Hut 8]].](https://commons.wikimedia.org/wiki/Special:FilePath/Turing flat.jpg?width=200 "Two cottages in the stable yard at [[Bletchley Park]]. Turing worked here in 1939 and 1940, before moving to [[Hut 8]].")
ENGLISH MATHEMATICIAN AND COMPUTER SCIENTIST (1912–1954)
Turing, A.M.; Alan Mathison Turing; Alan M. Turing; A. M. Turing; Alan turing; Alan Turning; Allan Turing; Allen Touring; A. Turing; Christopher Morcom; Turing; Alan Mathison Turing, OBE, FRS
n. Alan Turing (1912-1954) matematico inglese inventore di un modello matematico di tecnologia informatica, crittografo noto per aver collaborato a decifrare il codice del sistema nazista "Enigma" durante la seconda guerra mondiale
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
macchina turing (macchina teorica capace di eseguire operazioni semplici di input/output ad uso di verifica matematica)
Definitie
Turing test
¦ noun a series of questions used as a test for intelligence in a computer.
Wikipedia
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.
Voorbeelden uit tekstcorpus voor 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.