The infinite state acceptor and its application to AI

  • Authors:

  • Edward A. Isper, Jr.

  • Affiliations:

  • -

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

The infinite state acceptor is presented and is shown to be more powerful than the Turing machine for purposes of accepting strings. The role of abstraction in the design of such machines is discussed. It will be argued that such an acceptor is not merely an eccentric extrapolation of current models but is useful for the description of the behavior of devices whose complexity is nontrivial.