Главная
Study mode:
on
1
Introduction
2
Shared Wisdom
3
Theory of Computation
4
Operating System Conundrum
5
Example
6
Is there predestination
7
What is a solvable problem
8
Proof
9
turing machine
10
atomicity of operations
11
Isomorphism
12
By Simulation
13
observations
14
sequential interactive computation
15
simulation example
16
equivalence myth
17
functionbased computation
18
algorithms
19
algorithms in computer science
20
Interactive computation
21
Conjectures
Description:
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.

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

Center for Language & Speech Processing(CLSP), JHU
Add to list
0:00 / 0:00