Some Completeness Results in the Mathematical Theory of Computation,

Abstract

A formal theory is described which incorporates the 'assignment' function a(i,k,xi) and the 'contents' function c(i,xi). The axioms of the theory are shown to comprise a complete and consistent set. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 05, 1966
Accession Number
AD0785167

Entities

People

  • Donald M. Kaplan

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Applied Computer Science
  • Artificial Intelligence
  • Computations
  • Computer Science
  • Theory Of Computation

Readers

  • Business Analytics
  • Mathematical Modeling and Probability Theory.