Browsing AI Memos (1959 - 2004) by Issue Date

Now showing items 1-20 of 1217

    • Explanation of Big "P" as of March 20, 1959 

      Russell, S. R. (1959-03-01)
      ERROR is a routine to provide a common location for all routines. Its celling sequence is: SXD SERROR,4 TSX SERROR+1,4 The above is normally followed immediately by up to 20 registers of BCD remarks terminated by a word ...

    • Recursive Functions of Symbolic Expressions and Their Computation by Machine 

      McCarthy, J. (1959-03-13)
      The attached paper is a description of the LISP system starting with the machine-independent system of recursive functions of symbolic expressions. This seems to be a better point of view for looking at the system than the ...

    • Recursive Functions of Symbolic Expressions and Their Computation 

      McCarthy, J. (1959-03-30)
      This memorandum is a continuation of Memo 8.

    • Character-Handling Facilities in the LISP System 

      Abrahams, Paul (1961-01-01)
      Because of the new read program, a number of facilities are being added to the LISP system to permit manipulation of single characters and print names. Machine-language functions have been provided for breaking print names ...

    • The Proofchecker 

      Abrahams, Paul (1961-01-01)
      The Proofchecker is a heuristically oriented computer program for checking mathematical proofs, with the checking of textbook proofs as its ultimate goal. It constructs, from each proof step given to it, a corresponding ...

    • Arithmetic in LISP 1.5 

      Levin, Michael (1961-04-01)
      As of the present, the following parts of LISP 1.5 are working. This is an excerpt from the forth coming LISP 1.5 Programmer's Manual.

    • LISP Error Stops as of May 10, 1961 

      author, No (1961-05-01)
      no abstract

    • Introduction to the Calculus of Knowledge 

      Raphael, Bertram (1961-11-01)
      This paper deals with the "Calculus of Knowledge", an extension of the propositional calculus in which one may reason about what other people know. Semantic and Syntactic systems are developed, certain theorems are proven, ...

    • The Alpha-Beta Heuristic 

      Edwards, D.J.; Hart, T.P. (1961-12-01)
      The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the ...

    • Some Identities Concerning the Function Subst [x; y; z] 

      Norton, Lewis M. (1962-01-01)
      The purpose of this paper is two-fold; 1) to explore the use of recursion induction in proving theorem about functions of symbolic expressions, in particular. 2) to investigate thoroughly the algebraic properties of the ...

    • A Basis for a Mathematical Theory of Computation 

      McCarthy, John (1962-01-01)
      This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and computation has been added. ...

    • A Heuristic Program to Solve Geometric Analogy Problems 

      Evans, T.G. (1962-10-01)
      A program to solve a wide class of intelligence-test problems of the "geometric-analogy" type ("figure A is to figure B as figure C is to which of the following figures?") is being constructed. The program, which is written ...

    • A Proposal to Investigate the Application of a Heuristic Theory of Tree Searching to a Chess Playing Program 

      Bloom, Burton H. (1963-02-01)
      The problem of devising a mechanical procedure for playing chess is fundamentally the problem of searching the very large move-tree associated with a chess position. This tree-searching problem is representative of a large ...

    • Neural Nets and Theories of Memory 

      Minsky, Marvin (1963-03-01)
      A number of models developed in work often called "neural-net" research may be of interest to physiologists working on the problem of memory. From this work comes a variety of ideas on how networks of neuron-like elements ...

    • METEOR: A LISP Interpreter for String Transformations 

      Bobrow, Daniel G. (1963-04-01)
      Conditional expressions, composition and recursion are the basic operations used in LISP to define functions on list structures. Any computable function of arbitrarily complex list structures may be described using these ...

    • Computer Representation of Semantic Information 

      Raphael, Bertram (1963-04-01)
      A major obstacle in the development of learning machines, mechanical translation, advanced information retrieval systems, and other areas of artificial intelligence, has been the problem of defining, encoding, and representing ...

    • Suggested Conventions for LISP Time-Sharing System 

      Robnett, Richard A. (1963-04-01)
      Below is a list of suggested Conventions and De-bugging aids for LISP time-sharing. Any and all suggestions are encouraged and should be submitted in writing to R. A. Robnett in a hurry.

    • Universality of TAG Systems with P-2 

      Cocke, John; Minsky, Marvin (1963-04-01)
      In the following sections we show, by a simple direct construction, that computations done by Turing machines can be duplicated by a very simple symbol manipulation process. The process is described by a simple form of ...

    • Proposal for a FAP Language Debugging Program 

      Winett, Joel (1963-06-01)
      A time-sharing system for the 7090 computer is being developed at the M.I.T. Computation Center whereby many users can communicate simultaneously with the computer through individual consoles. In the time-sharing ...

    • Primitive Recursion 

      Levin, Michael (1963-07-01)
      This is one of a series of memos concerning a logical system for proof-checking. It is not self-contained, but belongs with future memos which will describe a complete formal system with its intended interpretation and ...