A Computationally Easy Indexing of a Language of While Programs

by Marshall, Andrew

Abstract (Summary)
The concept of an effective enumeration of all possible computer programs is a foundation of computability theory. To achieve an effective enumeration an indexing is applied to order the elements, or programs, of the model language. This thesis demonstrates a practical and computationally easy indexing of a model of computation often used in introductory computability courses, the language of while programs.
Bibliographical Information:


School:Bowling Green State University

School Location:USA - Ohio

Source Type:Master's Thesis

Keywords:effective enumeration while language


Date of Publication:01/01/2008

© 2009 All Rights Reserved.