A note on turing machine computability of rule driven systems

ABSTRACT

An abstract rule driven system is described. We prove that it is calculated by a restricted Turing Machine.

REFERENCES

• 1: Turing, Alan Mathison On computable numbers, with an application to the Entsceidungsproblem Proc. London Math. Soc., ser. 2 vol. 42, 1936-7, pp. 230--265.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Bounded-action devices (e.g., Turing machines, random access machines)

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.3 Deduction and Theorem Proving
          Subjects: Deduction (e.g., natural, rule-based)
      I.2.4 Knowledge Representation Formalisms and Methods
          Subjects: Representations (procedural and rule-based)

General Terms:
Theory

Keywords:
rule driven systems theory