Termination of Algorithms

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. (Author).

• ISBN 10 : OCLC:227491874
• Judul : Termination of Algorithms
• Pengarang : Zohar Manna,   CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE.,  
• Bahasa : en
• Tahun : 1968
• Halaman : 99
• Halaman : 99
• Google Book : http://books.google.co.id/books?id=btCJmQEACAAJ&dq=inauthor:manna%27&hl=&source=gbs_api
• Ketersediaan :

The thesis contains two parts which are self-contained units.