Accession Number : AD0670558

Title :   TERMINATION OF ALGORITHMS

Descriptive Note : Doctoral thesis

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Manna, Zohar

PDF Url : AD0670558

Report Date : Apr 1968

Pagination or Media Count : 109

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.

Descriptors :   *COMPUTER PROGRAMMING, ALGORITHMS, COMPATIBILITY, COMPUTER PROGRAMS, FLOW CHARTING, GRAPHICS, MATRICES(MATHEMATICS), NUMERICAL ANALYSIS, SEQUENCES(MATHEMATICS), SET THEORY, THEORY, THESES

Subject Categories : Theoretical Mathematics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE