Reddit reviews Computability and Unsolvability

Took it last spring.

The first third of the course covered basic logic stuff in a very pedantic way. The homework and notes are on OLI and are pretty much the same as Logic and Proofs (80210 i think).

Second third was about set theory stuff and incompleteness.

Last third was about Turing and undecidability, this was the text: https://www.amazon.com/gp/product/0486614719/

As someone who struggled with 251, I didn't find the material here particularly challenging. It's definitely the least rigorous of the CS logic electives. The first midterm was online, second midterm was half online and half in class, final was in class. I believe the 2nd midterm and final were curved pretty generously

Side note: the lectures are in the potato chip lecture hall in Scaife which gets so unbearably freaking hot in the spring semester I almost dropped the class because of it.

Sorry. The sentence is not circular. It only appears to be circular. The ideas are clearly explained in text books on computability theory. Or if you are smart and patient you can just read Turing's original paper, or if you are really smart and really patient Goedel's work as well. Take your time and use your own mind to form your own opinion.

https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf

https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems

My introduction was in this book:
https://www.amazon.com/Computability-Unsolvability-Prof-Martin-Davis/dp/0486614719

For more original sources:
https://www.amazon.com/Undecidable-Propositions-Unsolvable-Computable-Mathematics/dp/0486432289#reader_0486432289