Accession Number:

AD0670558

Title:

TERMINATION OF ALGORITHMS

Personal Author(s):

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Report Date:

1968-04-01

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.

Descriptive Note:

Doctoral thesis

Pages:

0109

Identifiers:

Communities Of Interest:

Modernization Areas:

Distribution Statement:

Approved for public release; distribution is unlimited.

File Size:

1.55MB