EdusalsaDiscover Your Stanford


Recursion Theory (PHIL 151A)

  • Not Offered

4 units

Letter or Credit/No Credit

Computable functions, Turing degrees, generalized computability and definability. "What does it mean for a function from the natural numbers to themselves to be computable?" and "How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". Theory of relative computability, reducibility notions and degree structures. Prerequisite is PHIL 150, or PHIL 151 or CS 103.

Course Prequisites

Sign Up

To save PHIL 251A to your course bucketlist

Already Have An Account? Log In