TERMINATION OF ALGORITHMS

Abstract

The thesis contains two parts which are self-contained units. In Part 1 we present several results on the relation between the problem of termination and equivalence of programs and abstract programs, and the first order predicate calculus. Part 2 is concerned with the relation between the termination of interpreted graphs, and properties of well-ordered sets and graph theory.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1968
Accession Number
AD0670558

Entities

People

  • Zohar Manna

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Calculus
  • Computations
  • Computer Programs
  • Computer Science
  • Computers
  • Construction
  • Functional Analysis
  • Graph Theory
  • Mathematical Logic
  • Mathematics
  • New Jersey
  • Numbers
  • Sequences
  • Theorems

Readers

  • Computational Linguistics
  • Electrical Engineering