# CSE 725 - Computability and Unsolvability

# Spring 2010

## Thought provoking links:

http://en.wikipedia.org/wiki/Hilbert's_tenth_problem

http://rjlipton.wordpress.com/2010/01/20/are-the-reals-really-uncountable/

http://en.wikipedia.org/wiki/Busy_beaver

## Textbook:

Introduction to the Theory of Computation, second edition. M. Sipser.

## Recommended reading:

## Syllabus:

PDF

## Office hours:

By instructor: W 2:00-3:00pm in DL 495 or by appointment.

By grader, Yanzhang(Ryan) He: Tu 4-5pm in CSE 574.

## Problem Sets:

PS1 (due lecture on April 28th).

PS2 (due lecture on May 19th).

PS3 (due lecture on June 2nd).

## Topics by lecture (tentative):