CSCE 627

Theory of Computability

Texas A&M University · UGRD · Fall 2026

1 section

Catalog description

Credits 3. 3 Lecture Hours. Formal models of computation such as pushdown automata; Turing machines and recursive functions; unsolvability results; complexity of solvable results. Prerequisite: CSCE 433 .

Sections

Current meeting, instructor, credit, and enrollment details

Updated 4 hours ago

001

Availability not recently verified

Class #texas_am-2325Fall 2026UGRD

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?