Exact Real Computation is the paradigm of identifying, formalizing, implementing, verifying, and imperatively operating on, continuous structures (in the sense of Universal Algebra) as Abstract Data Types (in the sense of Computer Science) with computable semantics (in the sense of Computable Analysis).

This mini-workshop on May 16 (Thursday) will recall the motivation and current progress.
Location: E 3-1, #3444

• 11:00 Martin: Motivation, Vision, and Discussion
• 12:00 Lunch
• 13:30 Seokbin: Grassmannian
• 14:00 Gyesik: Hoare Type Theory in concise form
• 14:30 Sewon: Type Theory with Abstract Reals
• 15:00 Dongseong: Computability of Haar Integrals
• 15:30 Coffee/break
• 16:00 Donghyun: Representation Theory of Compact Metric Spaces
• 16:30 Sveta: Differential Equations
• 17:00 Ivan: Polynomial and Matrix Powering
• 17:30 Hyunwoo: Randomized Computation
• 18:00 Youngjo: Analytic Continuation

May 17, Sabrina Ouazzani :How to compute with an infinite time Turing machine?