Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
seminars [2021-05-04] – [Lazy types in iRRAM and computability of Mandelbrot set] Svetlana Selivanova | seminars [2023-06-28] (current) – 2023 Martin Ziegler | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Seminar on Theoretical Computer Science, Logic, and Real Computation ====== | ====== Seminar on Theoretical Computer Science, Logic, and Real Computation ====== | ||
+ | * [[Seminars# | ||
+ | * [[Seminars# | ||
* [[Seminars# | * [[Seminars# | ||
* [[Seminars# | * [[Seminars# | ||
Line 9: | Line 11: | ||
* [[Seminars# | * [[Seminars# | ||
+ | ===== 2023 ===== | ||
+ | |||
+ | * June 28, 19h KST | ||
+ | * Rakhman Ulzhalgas (KAIST) | ||
+ | |||
+ | "// | ||
+ | by Barbara Kempkes and Friedhelm Meyer auf der Heide (2012) | ||
+ | |||
+ | ===== 2022 ===== | ||
+ | |||
+ | ====Computing with Infinite Objects via Coinductive Definitions==== | ||
+ | * June 2, 14h30 KST | ||
+ | * Dieter Spreen (U Siegen) | ||
+ | |||
+ | // | ||
+ | A representation-free logic-base approach for computing with infinite objects will be presented. The logic is intuitionistic first-order logic extended by strictly positive inductive and coinductive definitions. Algorithms can be extracted from proofs via realizability. The approach allows to deal with objects like the real numbers and nonempty compact sets of such. More general, it allows to deal with compact metric spaces that come equipped with a finite set of contractions such that the union of their ranges covers the space, and with continuous maps between such spaces. The computational power of the approach is equivalent to that of type-two theory of effectivity. | ||
+ | |||
+ | {{http:// | ||
===== 2021 ===== | ===== 2021 ===== | ||
- | Currently | + | |
+ | |||
+ | ====Book Review " | ||
+ | * July 9, 16h00, | ||
+ | * Lwam Z. Araya (KAIST) | ||
+ | |||
+ | Abstract: | ||
+ | //Governing the Commons: The Evolution of Institutions for Collective Action// is an examination of the nature of the commons, and the evolution and development of self-organisation and self-governance of those commons. //The Evolution of Institutions | ||
====Lazy types in iRRAM and computability of Mandelbrot set==== | ====Lazy types in iRRAM and computability of Mandelbrot set==== | ||
Line 17: | Line 44: | ||
* Jihoon Hyun (KAIST) | * Jihoon Hyun (KAIST) | ||
- | Abstract: iRRAM iterates all over if more precision is needed. In other words, iRRAM iterates all over even if only a few parts of the program | + | Abstract: iRRAM iterates all over if more precision is needed. In other words, iRRAM iterates all over even if only a few parts of the program |
+ | |||
+ | Mandelbrot set is a set of complex numbers whose exterior is computably enumerable. There is a conjecture which says that the Mandelbrot set is also computably enumerable. I will mention some facts about the set, and explain what I have done with iRRAM to draw the set on a plane. | ||
====Introduction to mathematical Ludology==== | ====Introduction to mathematical Ludology==== | ||
Line 26: | Line 55: | ||
In this talk, I introduce a young academic discipline called Ludology, especially mathematical Ludology which studies and analyzes the game ' | In this talk, I introduce a young academic discipline called Ludology, especially mathematical Ludology which studies and analyzes the game ' | ||
- | ====Introduction to Riemannian Geometry, Part IV==== | + | ====Introduction to Riemannian Geometry, Part IV and V==== |
* Apr 1, 16h00, via Zoom | * Apr 1, 16h00, via Zoom | ||
* Apr 22, 16h00, via Zoom (continued) | * Apr 22, 16h00, via Zoom (continued) |