Emporia ESIRC

The halting problem.

ESIRC/Manakin Repository

Show simple item record

dc.contributor.author Wagner, Lisa Jo.
dc.date.accessioned 2012-07-12T21:51:14Z
dc.date.available 2012-07-12T21:51:14Z
dc.date.created 1989 en_US
dc.date.issued 2012-07-12
dc.identifier.uri http://hdl.handle.net/123456789/1887
dc.description 48 leaves en_US
dc.description.abstract The primary purpose of this thesis is to show the unsolvability of the Halting problem. To do this, an introduction of the Turing machine and some basic examples using the Turing machine are given. Primitive recursion, Godel numbering, mu-recursion and recursive enumerability are discussed in relation to Church's thesis and solvability using a Turing machine. Using this information, the solvability of the Halting problem is discussed. Finally, an example of an uncomputable function, Rado's function, (the Busy Beaver problem) is presented. en_US
dc.language.iso en_US en_US
dc.subject Turing machines. en_US
dc.subject Recursive functions. en_US
dc.subject Gödels̓ theorem. en_US
dc.title The halting problem. en_US
dc.type Thesis en_US
dc.college las en_US
dc.advisor James Anderson en_US
dc.department mathematics, computer science, and economics en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record