2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: PHIL 152: Computability and Logic

PHIL 152: Computability and Logic (PHIL 252)

Approaches to effective computation: recursive functions, register machines, and programming styles. Proof of their equivalence, discussion of Church's thesis. Elementary recursion theory. These techniques used to prove Gödel's incompleteness theorem for arithmetic, whose technical and philosophical repercussions are surveyed. Prerequisite: 151.
Terms: Spr | Units: 4 | UG Reqs: GER:DB-Math
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints