Program Dates, Times & Details
Session II: August 3-28, 2020
Duration: 4 weeks
Live (Synchronous) Session Times: Thursdays; 6:30 – 8 p.m. EST
Course Number: 72732
Just how general-purpose are modern general-purpose computers? What could they compute were there no limitations of storage space or computing time? Is there anything impossible to compute?
The theory of computability addresses these and related questions. Our course provides an introduction to this theory, covering basics including:
- formal models of computation
- equivalence of formal models
- important problems in math, computer science and philosophy that are unsolvable in any formal paradigm of computation (these include problems of great practical importance, such as the non-existence of automatic debuggers to fix erroneous programs)
Program & Technology Requirements
- Reliable internet access
- Minimally, a laptop with webcam and audio. (Best would be a monitor connected to laptop or desktop)
Dr. Robert J. Irwin
Dr. Irwin is a recently retired Syracuse University faculty member from the Department of Electrical Engineering and Computer Science. He has served as an assistant professor of computer science at SUNY Oswego, was visiting faculty at Hamilton College, and has also taught at Le Moyne College and Pace University. Prior to returning to academic life, Robert was a research engineer at TextWise, LLC. (natural language processing specialists in Syracuse), and the Director of Software Engineering for Applied Intelligence Systems, Inc. (an AI development firm in New York City). Irwin was also a member of the research staff at Riverside Research Institute and a project manager at Merrill Lynch in New York City. His chief research interests lie in theoretical computer science, and he has published in the areas of generalized dynamical systems, high-order theory of computation and complexity, and artificial intelligence.