This is an old revision of the document!


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 workshop on May 16 (Thursday) will recall the motivation and current progress. Location: TBD

  • 11:00 Martin: Motivation and Vision, Discussion
  • 12:00 Lunch
  • 13:30 Gyesik: Verification
  • 14:15 Seokbin: Grassmannian
  • 14:45 Sewon: Type Theory
  • 15:15 Coffee/break
  • 15:30 Dongseong: Haar Measure
  • 16:00 Donghyun: Bit-Complexity and Entropy
  • 16:30 Ivan: Polynomial and Matrix Powering
  • 17:00 Sveta: Differential Equations
  • 17:45 Hyunwoo: Randomization
  • 18:15 Youngjo: Analytic Continuation
  • 19:00 dinner