Peter C. ChapinCraig A. DamonComputer Information SystemsCIS-3170History: Theory of Computation3trueTheory of Computation3000The Universal Computer: The Road from Leibniz to TuringMartin DavisUnderstand the principles of early computational devices.Express arguments using Boolean logic.Use Frege formula language (Begriffsschrift)Understand the significance of finite and infinite number representation.Comprehend the basics of Turing universal computing machines.Understand the limits of Shannon's Law and the implications of Moore's
Law.Ancient computers from Babylon to Greece.Early mechanical computers: adding machines.Improvements to mechanical devices: multiplication and division.Leibniz vision of a universal computing device.Boolean logic introduction.Boolean logic.Frege formula language introduction.Frege formula language.Representation of infinite number series.Contributions by Hilbert.Godel explores advanced logic principles.Introduction to Turing Machines.Turning Machines.The future of computing: Shannon's Law and Moore's Law.face-to-face