Welcome

Research and teaching @ TUHH

Friday, April 15, 2011

Computability & Complexity - Lecture 2

Topics:.
  • Peano schemes
  • Fundamental lemma
  • Primitive recursion
  • Class of primitive recursive functions
  • Each primitive recursive function is URM computable
  • Closure properties: transformation of variables and parametrization.
Posted by at
Labels: ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)