Artificial Intelligence Memos
Search Results
- Title:
- An Algebraic Simplify Program in LISP. AIM-011
- Author:
- Wooldridge, Dean E.
- Collector:
- Wooldridge, Dean E.
- Description:
-
A program which performs 'obvious' (non-controversial) simplifying
transformations on algebraic expressions (written in LISP prefix
notation) is described. Cancellation of inverses and consolidation
of sums and products are the basic accomplishments of the program;
however, if the user desires to do so, he may request the program to
perform special tasks, such as collect common factors from the
products in sums or expand products. Polynomials are handled by
routines which take advantage of the special form by polynomials; in
particular, division (not cancellation) is always done in terms of
polynomials. The program (run on the IBM 7090) is slightly faster
than a human; however, the computer does not need to check its work
by repeating the simplification.
Although the program is usable -- no bugs are known to exist -- it
is by no means a finished project. A rewriting of the simplify
system is anticipated; this will eliminate much of the existing
redundancy and other inefficiency, as well as implement an
identity-recognizing scheme.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- December 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1963
- Genre:
- memorandums
- Identifier:
- AIM-011
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Clock function for LISP 1.5. AIM-004
- Author:
- Enea, Horace
- Collector:
- Enea, Horace
- Description:
- This paper describes a clock function for LISP 1.5
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- August 2, 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 2, 1963
- Genre:
- memorandums
- Identifier:
- AIM-004
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Computing Estimates for the Number of Bisections of an NxN Checkerboard for N Even. AIM-009
- Author:
- Williams, Charles M.
- Collector:
- Williams, Charles M.
- Description:
-
This memo gives empirical justification for the assumption that the
number of bisections of an NxN (N even) checkerboard is
approximately given by the binomial coefficient (A, A/2) where 2A is
the length of the average bisecting cut.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- December 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1963
- Genre:
- memorandums
- Identifier:
- AIM-009
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Improvements in LISP Debugging. AIM-010
- Author:
- Russell, Stephan R.
- Collector:
- Russell, Stephan R.
- Description:
-
Experience with writing large LISP progrrams and helping students
learning LISP suggests that spectacular improvements can be made in
this area. These improvements are partly an elimination of sloppy
coding in LISP 1.5, but mostly an elaboration of DEFINE, the push
down list backtrace, and the current tracing facility. Experience
suggests that these improvements would reduce the number of computer
runs to debug a program a third to a half.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- December 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1963
- Genre:
- memorandums
- Identifier:
- AIM-010
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Non-printing Compiler. AIM-006
- Author:
- Wooldridge, Dean E.
- Collector:
- Wooldridge, Dean E.
- Description:
-
A short program which redefines parts of the LISP 1.5 compiler and
suppresses compiler print out (at user's option) is described.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- August 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1963
- Genre:
- memorandums
- Identifier:
- AIM-006
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Predicate calculus with "undefined" as a truth-value. AIM-001
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
- The use of predicate calculus in the mathematical theory of computation and the problems involved in interpreting their values.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- March 22, 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), March 22, 1963
- Genre:
- memorandums
- Identifier:
- AIM-001
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Programs With Common Sense. AIM-007
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
-
Interesting work is being done in programming computers to solve
problems which require a high degree of intelligence in humans.
However, certain elementary verbal reaesoning processes so simple
they can be carried out by any non-feeble-minded human have yet to be
simulated by machine programs.
This paper will discuss programs to manipulate in a suitable formal
language (most likely a part of the predicate calculus) common
instrumental statements. The basic program will draw immediate
conclusions from a list of premises. These conclusions will be
either declarative or imperative sentences. When an imperative
sentence is deduced the program takes a corresponding action. These
actions may include printing sentences, moving sentences on lists,
and reinitiating the basic deduction process on these lists.
Facilities will be provided for communication with humans in the
system via manual intervention and display devices connected to the
computer.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- September 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1963
- Genre:
- memorandums
- Identifier:
- AIM-007
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Situations, actions, and causal laws. AIM-002
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
-
A formal theory is given concerning situations. causality and the possibility and effects of actions is given. The theory is intended to be used by the Advice Taker, a computer program that is to decide what to do by reasoning. Some simple examples are given of descriptions of situations and deductions that certain
goals can be achieved.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 3, 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 3, 1963
- Genre:
- memorandums
- Identifier:
- AIM-002
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Storage Conventions in LISP 2. AIM-008
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
-
Storage conventions and a basic set of functions for LISP 2 are
proposed. Since the memo was written, a way of supplementing the
features of this system with the unique storage of list structure
using a hash rule for computing the address in a separate free
storage area for lists has been found.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- September 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1963
- Genre:
- memorandums
- Identifier:
- AIM-008
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- "The Mikado" as an advice taker problem. AIM-003
- Author:
- Safier, Fred
- Collector:
- Safier, Fred
- Description:
-
The situation of the Second Act of "The Mikado" is analyzed from the point of view of Advice Taker
formalism. This indicates defects still present in the language.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 1963
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 1963
- Genre:
- memorandums
- Identifier:
- AIM-003
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- A Formal Description of a Subset of ALGOL. AIM-024
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
-
We describe Microalgol, a trivial subset of Algol, by means of an interpreter. The notions of abstract syntax and of 'state of the computation' permit a compact description of both syntax and semantics. We advocate an extension of this technique as a general
way of describing programming language.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- September 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1964
- Genre:
- memorandums
- Identifier:
- AIM-024
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- A Formal System of Computation. AIM-025
- Author:
- Mansfield, Richard
- Collector:
- Mansfield, Richard
- Description:
- We discuss a tentative axiomatization for a formal system of computation and within this system we prove certain propositions about the convergence of recursive definitions proposed by J. McCarthy.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- September 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1964
- Genre:
- memorandums
- Identifier:
- AIM-025
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- A Tough nut for Proof Procedures. AIM-016
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
- It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 1964
- Genre:
- memorandums
- Identifier:
- AIM-016
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- An Expression Input Routine for LISP. AIM-018
- Author:
- Hext, Jan
- Collector:
- Hext, Jan
- Description:
- The expression input routine is a LISP function, Mathread [ ] with associated definitions, which reads in expressions such as (A+3-F(X,Y,Z)). Its result is an equivalent S-expression. The syntax of allowable expressions is given, but (unlike ALGOL's) it does not define the precedence of the operators; nor does the program carry out any explicit syntax analysis. Instead the program parses the expression according to a set of numerical precedence values, and reports if it finds any symbol out of context.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 1964
- Genre:
- memorandums
- Identifier:
- AIM-018
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Axiomatization and Implementation. AIM-015
- Author:
- Finkelstein, Mark and Safier, Fred
- Collector:
- Finkelstein, Mark and Safier, Fred
- Description:
-
An example of a typical Advice-Taker axiomatization of a situation is given, and the situation is programmed in LISP as an indication
of how the Advice-Taker could be expected to react. The situation
chosen is the play of a hand of bridge.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- June 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), June 1964
- Genre:
- memorandums
- Identifier:
- AIM-015
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Computer Control of a Machine for Exploring Mars. AIM-014
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
-
Landing a 5000 pound package on Mars that would spend a year looking for life and making other measurements has been proposed. We believe that this machine should be a stored program computer with sense and motor organs and that the machine should be mobile. We discuss the following points:
1. Advantages of a computer controlled system.
2. What the computer should be like.
3. What we can feasible do given the present state of work on artificial intelligence.
4. A plan for carrying out research in computer controlled experiments that will make the Mars machine as effective as possible.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- January 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), January 1964
- Genre:
- memorandums
- Identifier:
- AIM-014
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Documentation of the MacMahon Squares Problem. AIM-012
- Author:
- Feldman, Gary
- Collector:
- Feldman, Gary
- Description:
-
An exposition of the MacMahon Squares problem together with some 'theoretical' results on the nature of its solutions and a short discussion of an ALGOL program which finds all solutions are
contained herein.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- December 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), December 1964
- Genre:
- memorandums
- Identifier:
- AIM-012
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Experiments on Automatic Speech Recognition by a Digital Computer. AIM-026
- Author:
- Reddy, D. Raj
- Collector:
- Reddy, D. Raj
- Description:
-
Speech sounds have in the past been investigated with the aid of spectographs, vo-coders and other analog devices. With the availability of digital computers with improved i-o devices such as Cathode Ray tubes and analog digital converters, it has recently become practicable to employ this powerful tool in the analysis of speech sounds.
Some papers have appeared in the recent literature reporting the use of computers in the determination of the fundamental frequency and for vowel recognition. This paper discusses the details and results of a preliminary investigation conducted at Stanford. It includes
various aspects of speech sounds such as waveforms of vowels and consonants; determination of a fundamental of the wave; Fourier (spectral) analysis of the sound waves format determination, simple vowel recognition algorithm and synthesis of sounds. All were
obtained by the use of a digital computer.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- October 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), October 1964
- Genre:
- memorandums
- Identifier:
- AIM-026
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Formal Description of the Game of Pang-Ke. AIM-017
- Author:
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
- The game of Pang-Ke is formulated in a first-order-logic in order to provide grist for the Advice-Taker Mill. The memo does not explain all the terms used.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 1964
- Genre:
- memorandums
- Identifier:
- AIM-017
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Kalah -- the Game and the Program. AIM-022
- Author:
- Russell, Richard
- Collector:
- Russell, Richard
- Description:
- A description of Kalah and the Kalah program, including sub-routine descriptions and operating instructions.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- September 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), September 1964
- Genre:
- memorandums
- Identifier:
- AIM-022
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- LISP 2 Specifications Proposal. AIM-021
- Author:
- Mitchell, R. W.
- Collector:
- Mitchell, R. W.
- Description:
-
Specifications for a LISP 2 system are proposed. The source language is basically Algol 60 extended to include list processing, input/output and language extension facilities. The system would be implemented with a source language translator and optimizer, the output of which could be processed by either an interpreter or a compiler. The implementation is specified for a single address
computer with particular reference to an IBM 7090 where necessary .
Expected efficiency of the system for list processing is significantly greater than the LISP 1.5 compiler. For execution of numeric algorithms the systems should be be comparable to many
current "algebraic" compilers. Some familiarity with LISP, 1.5 Algol and the IBM 7090 is assumed.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- August 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1964
- Genre:
- memorandums
- Identifier:
- AIM-021
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Programming Languages and Translation. AIM-019
- Author:
- Hext, Jan
- Collector:
- Hext, Jan
- Description:
-
A notation is suggested for defining the syntax of a language in abstract form, specifying only its semantic constituents. A simple language is presented in this form and its semantic definition given
in terms of these constituents. Methods are then developed for translating this language, first into LISP code and from there to machine code, and for proving that the translation is correct.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- August 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1964
- Genre:
- memorandums
- Identifier:
- AIM-019
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Title:
- Source Language Optimization of For-loops. AIM-020
- Author:
- Reddy, D. Raj
- Collector:
- Reddy, D. Raj
- Description:
-
Program execution time can be reduced, by a considerable amount, by optimizing the 'For-loops' of Algol programs. By judicious use of index registers and by evaluating all the sub-expressions whose
values are not altered within the 'For-loop', such optimization can be achieved.
In this project we develop an algorithm to optimize Algol programs in list-structure form and generate a new source language program, which contains the 'desired contents in the index registers' as a
part of the For-clause of the For-statement and additional statements for evaluating the same expressions outside the 'For-loop' This optimization is performed only for the innermost 'For-loops'.
The program is written entirely in LISP. Arrays may have any number of subscripts. Further array declarations may have variable dimensions. (Dynamic allocation of storage.) The program does not
try to optimize arithmetic expressions. (This has already been extensively investigated.)
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- August 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), August 1964
- Genre:
- memorandums
- Identifier:
- AIM-020
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009