Jul 20, 2025  
2025-2026 Undergraduate Bulletin 
    
Catalog Navigation
  Bulletin Home
  SUNY Geneseo Mission, Vision and Values
  College Policies
  History of SUNY Geneseo
  Academic Programs
  Course Descriptions
  Requirements for Baccalaureate Degree Programs
  General Education Curriculum
  Baccalaureate Degree Programs
  Pre-Professional Advisory and Partnership Programs
  Academic Policies, Standards, and Information
  Academic Services
  Student Services
  Academic Organizations
  Student Accounts
  Student and Campus Life
  Campus Auxiliary Services
  Advancement
  Enrollment Management & Admissions
  Financial Aid
  Emeriti/Emeritae
  Archived Catalogs
  My Favorites
HELP
2025-2026 Undergraduate Bulletin
Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Favorites (opens a new window)

MATH 304 - Theory of Computability

Credit(s): 3
Lecture: 3
Non-Lecture: 0


This course covers the theoretical limits on what algorithms can and cannot compute. Topics include finite automata, regular languages, push-down automata, context-free languages, Turing machines, decidability, the structure of the classes of computable and uncomputable problems, and the relationships between computability and the logical limits of mathematics.

Prerequisite(s): MATH 239  
Offered: Spring Semester - Odd Years



Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Favorites (opens a new window)