Conjectures, Results, and Myths in Interactive Computation - 2005 Lecture

Explore the paradigm shift from algorithms to interaction in computer science through this lecture by Dina Goldin from the University of Connecticut. Delve into the evolution of computational models, from traditional Turing Machines to Persistent Turing Machines (PTMs), which better represent interactive computation. Examine the proof of Wegner's conjecture that interaction is more powerful than algorithms, and investigate the implications for software engineering, AI, and mobile computing. Consider the historical context and widespread misinterpretation of the Church-Turing Thesis, and how it has influenced mainstream computational theory. Gain insights into models of interaction, database queries, and the future of computer science from Dr. Goldin's expertise in mathematics and computer science from Yale and Brown University.

Introduction
Shared Wisdom
Theory of Computation
Operating System Conundrum
Example
Is there predestination
What is a solvable problem
Proof
turing machine
atomicity of operations
Isomorphism
By Simulation
observations
sequential interactive computation
simulation example
equivalence myth
functionbased computation
algorithms
algorithms in computer science
Interactive computation
Conjectures