Advertisement

Automatic Reasoning, Algebraic Intelligence

  • W. Richard Stark

Abstract

What is really happening when a machine does something that seems to be intelligent? If it recognizes a spoken word, proves a theorem, plays a good chess game, or solves a problem in calculus, then does it have some idea of what is going on? Of course not. Machine intelligence is fundamentally different from human intelligence. It is an illusion based on algebraic links between syntax and semantics. The semantics of a language represents meaning in terms of an object world. When a machine’s behavior seems intelligent, it is because it is semantically appropriate. However, the machine is simply a symbol shuffler—its abilities are limited to syntactic processing. Algebraic systems which provide strong formal connections between their semantics and their syntax make it possible for a symbol shuffling machine to appear to understand what it is doing.

Keywords

Propositional Logic Theorem Prove Truth Table Predicate Logic Automatic Reasoning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1990

Authors and Affiliations

  • W. Richard Stark
    • 1
  1. 1.Department of MathematicsUniversity of South FloridaTampaUSA

Personalised recommendations