1054 search results - page 2 / 211 » A Formalization of the Turing Test |
145
Voted
MCU
1998
15 years 3 months ago
1998
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
116
click to vote
JAPLL
2008
15 years 1 months ago
2008
Maurer machines are much closer to real computers than Turing machines. Computer instructions play a prominent part in Maurer machines. We show a straightforward way to simulate Tu...
125
click to vote
EUROGP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
120
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
AAAI
1994
15 years 3 months ago
1994
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the...