Jun 17, 2024  
Rensselaer Catalog 2023-2024 
    
Rensselaer Catalog 2023-2024
Add to Portfolio (opens a new window)

MATH 4030 - Computability and Logic


This course covers basic concepts and results in mathematical logic and computability theory, including decision procedures, automated theorem proving techniques for truth-functional and first-order logic, axiomatizations of set theory and arithmetic, Turing Machines, Abacus Machines, recursive functions, the Church-Turing Thesis, the halting problem, undecidability of first-order logic, undecidability of arithmetic, and Godel’s incompleteness results.

Prerequisites/Corequisites: Prerequisite: PHIL 2140  or CSCI 2200 .

When Offered: Spring term odd-numbered years.

Cross Listed: CSCI 4420  and PHIL 4420  ;Students cannot obtain credit for both this course and PHIL or CSCI.

Credit Hours: 4



Add to Portfolio (opens a new window)