Ackermann Links
2 views
Skip to first unread message
Nick
Feb 6, 2009, 11:42:48 AM2/6/09
to Computability and Logic
http://imps.mcmaster.ca/courses/CAS-701-08/presentations/ackermann.pdf
-prove ackermann is computable by showing it's arguments get
lexicographically smaller
http://www.nationmaster.com/encyclopedia/Ackermann-function
- definition via primitive recursion
http://www.cs.clemson.edu/~goddard/handouts/cpsc839/extract.pdf
- bounded vs. unbounded, diagonalization argument for existence of non-
p.r. computable function.
-prove ackermann is computable by showing it's arguments get
lexicographically smaller
http://www.nationmaster.com/encyclopedia/Ackermann-function
- definition via primitive recursion
http://www.cs.clemson.edu/~goddard/handouts/cpsc839/extract.pdf
- bounded vs. unbounded, diagonalization argument for existence of non-
p.r. computable function.
Reply all
Reply to author
Forward
0 new messages