Welcome

Research and teaching @ TUHH

Friday, May 6, 2011

Computability & Complexity - Lecture 4

Topics:
  • number theoretic functions
  • loop programs and loop computable functions
  • partial recursive functions
  • (unbounded) minimalization
  • partial recursive functions are URM computable
Posted by at
Labels: ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)