Sciweavers

1054 search results - page 5 / 211
» A Formalization of the Turing Test
Sort
View
ARTMED
2008
74views more  ARTMED 2008»
14 years 10 months ago
First, scale up to the robotic Turing test, then worry about feeling
Stevan Harnad, Peter Scherzer
CIE
2006
Springer
14 years 10 months ago
Turing's test and believable AI in games
Daniel Livingstone
CORR
2000
Springer
133views Education» more  CORR 2000»
14 years 10 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
SIGCSE
2006
ACM
128views Education» more  SIGCSE 2006»
15 years 4 months ago
Turning automata theory into a hands-on course
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
Susan H. Rodger, Bart Bressler, Thomas Finley, Ste...