First Page | Document Content | |
---|---|---|
Date: 2002-03-26 18:13:58Finite-state machine Nondeterministic finite automaton Computer chess Robot Chess Ω-automaton Automata theory Models of computation Games | FREE WILL—EVEN FOR ROBOTS John McCarthy Computer Science Department Stanford University Stanford, CA 94305, USAAdd to Reading ListSource URL: www-formal.stanford.eduDownload Document from Source WebsiteFile Size: 182,77 KBShare Document on Facebook |