Goto

Collaborating Authors

 Country


Beyond Regression: New Tools for Prediction and Analysis in the Behavioral Sciences

Classics

See also Werbos, Paul J. (1994). The Roots of Backpropagation. From Ordered Derivatives to Neural Networks and Political Forecasting. New York, NY: John Wiley & Sons, Inc. Rumelhart, David E.; Hinton, Geoffrey E., Williams, Ronald J. (8 October 1986). "Learning representations by back-propagating errors". Nature323 (6088): 533–536. doi:10.1038/323533a0.Ph.D. thesis, Harvard University.


Minds, machines and phenomenology: Some reflections on Dreyfus’ What Computers Can’t Do

Classics

Rather than provide a general review of Dreyfus critique this article concentrates on certain fundamental criticisms that Dreyfus directs at the information-processing approach to cognitive psychology and points out the unique conception of what it means to understand cognition which separates a phenomenologist from the typical cognitive psychologist.


Introduction to the mathematical theory of computation

Classics

"With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects of the process. A classic of sequential program verification, this volume has been translated into almost a dozen other languages and is much in demand among graduate and advanced undergraduate computer science students. Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus (basic notions, natural deduction, and the resolution method); verification of programs (both flowchart and algol-like programs); flowchart schemas (basic notions, decision problems, formalization in predicate calculus, and translation programs); and the fixpoint theory of programs (functions and functionals, recursive programs, and verification programs). The treatment is self-contained, and each chapter concludes with bibliographic remarks, references, and problems." New York: McGraw-Hill, 1974.


Natural language understanding systems within the AI paradigm: A survey and some comparisons

Classics

AI Memo 237, AI Laboratory, Stanford University. (Also in A. Zampolli, Ed., Linguistic structures processing. Amsterdam: North-Holland,



Steps Toward Automatic Theory Formation

Classics

This paper describes a theory formation system which can discover a partial axiomization of a data base represented as extensionally defined binary relations.- The system first discovers all possible intensional definitions of each binary relation in terms of the others. It then determines a minimal set of these relations from which the others can be defined. It then attempts to discover all the ways the relations of this minimal set can interact with each other, thus generating a set of inference rules. Although the system was originally designed to explore automatic techniques for theory construction for question-answering systems, it is currently being expanded to function as a symbiotic system to help social scientists explore certain kinds of data bases.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.


Doing Arithmetic With Diagrams

Classics

A theorem prover for part of arithmetic in described which proves theorems by representing them in the form of a diagram or network. The nodes of this network represent 'ideal integers', i.e. objects which have all the properties of integers, without being any particular intoger. The links in the network represent relationships between 'ideal integers'. The procedures which draw these diagrams make elementary deductions based on their built-in knowledge of the functions and predicates of arithmetic. This theorem prover is intended as a model of some kinds of human problem-solving behaviour. Also found at EdinburghIn IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.



A LISP Machine with Very Compact Programs

Classics

This paper presents a machine designed for compact representation and rapid execution of LISP programs. The machine language is a factor of 2 to 5 more compact than S-expressions or conventional compiled code, and the.compiler is extremely simple. The encoding scheme is potentiall y applicable to data as wel l as program. The machine also provides for user-defined data structures.In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.


The Hearsay Speech Understanding System: An Example of the Recognition Process

Classics

This paper describes the structure and operation of the Hearsay speech understanding system by the use of a specific example illustrating the various stages of recognition. The system consists of a set of cooperating independent processes, each representing a source of Knowledge. The knowledge is used either to predict what may appear in a given context or to verify hypotheses resulting from a prediction. The structure of the system is illustrated by considering its Operation in a particular task situation: Voice-Chess. The representation and use of various sources of knowledge are outlined. Preliminary results of the reduction in search resulting from the use of various sources of knowledge are given.See also: IEEE Transactions on Computers C-25:427-431.(1976).In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California.