Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


bgsu1206215586.pdf (1.2 MB)

ETD Abstract Container

Abstract Header

A Computationally Easy Indexing of a Language of While Programs

Marshall, Andrew
http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586

Abstract Details

2008, Master of Science (MS), Bowling Green State University, Computer Science.
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.
Larry Dunning, PhD (Advisor)
Ron Lancaster, PhD (Committee Member)
Ray Kresman, PhD (Committee Member)
26 p.
Computer Science
effective enumeration; while language;

Recommended Citations

Citations

  • Marshall, A. (2008). A Computationally Easy Indexing of a Language of While Programs [Master's thesis, Bowling Green State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586

    APA Style (7th edition)

  • Marshall, Andrew. A Computationally Easy Indexing of a Language of While Programs. 2008. Bowling Green State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586.

    MLA Style (8th edition)

  • Marshall, Andrew. "A Computationally Easy Indexing of a Language of While Programs." Master's thesis, Bowling Green State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1206215586

    Chicago Manual of Style (17th edition)

bgsu1206215586
848
© 2008, all rights reserved.
This open access ETD is published by Bowling Green State University and OhioLINK.