CS 464AComputability and Recursive Function Theory
- Faculty
- Mathematics
- Last listed
- 1988–89
No longer offered. It’s in Waterloo’s scanned calendars from 1986–87 to 1988–89; the 1995–96 to 2023–24 calendars are on ucalendar.
Models of the computational process as reflected by computers, linguistic systems, functional specifications, transformational systems, formal logic, etc. Equivalence of these models. Computational complexity for specific models and abstractions fitting all models. Formal reducibilities between computational problems, and the complexity of these reducibilities.
As printed in the 1986–87 to 1988–89 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: CS 360 and fourth-year standing
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1986–87 to 1988–89, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1986–87 to 1988–89 2 calendars
Models of the computational process as reflected by computers, linguistic systems, functional specifications, transformational systems, formal logic, etc. Equivalence of these models. Computational complexity for specific models and abstractions fitting all models. Formal reducibilities between computational problems, and the complexity of these reducibilities.
Prereq: CS 360 and fourth-year standing