Michael Nedzelsky

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
This document presents the formalization of introductory material from recursion theory — definitions and basic properties of primitive recursive functions, Cantor pairing function and computably enumer-able sets (including a proof of existence of a one-complete computably enumerable set and a proof of the Rice's theorem).
  • 1