Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
seminars [2021-05-04] – [Lazy types in iRRAM and computability of Mandelbrot set] Svetlana Selivanovaseminars [2024-09-25] (current) – [iRRAM for Knots] 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#2024]]  
 +  * [[Seminars#2023]]
 +  * [[Seminars#2022]]
   * [[Seminars#2021]]   * [[Seminars#2021]]
   * [[Seminars#2020]]   * [[Seminars#2020]]
Line 9: Line 12:
   * [[Seminars#2015]]   * [[Seminars#2015]]
  
 +===== 2024 =====
 +
 +====iRRAM for Knots====
 +  * September 26, 11h00 KST 
 +  * hybrid offline (N1 #524) + online (Zoom, ask for coordinates)
 +  * Jaden Jorradol (KAIST)
 +
 +Rehearsal for presentation of [[https://cs.kaist.ac.kr/research/techReport|KAIST Technical Report CS-TR-2024-428]] at [[https://www.lix.polytechnique.fr/CCC2024/|CCC'2024]].
 +
 +====Implementation of the Burau spectral test====
 +  * June 4, 13h30 KST
 +  * hybrid offline (N1 #422) + online (Zoom, ask for coordinates)
 +  * Alexander Stoimenov (Dongguk University)
 +  * Jaden Jorradol (KAIST)
 +
 +We use the spectrum of the Burau representation to introduce
 +a series of tests for a braid being conjugate
 +to a reducible braid, valid for every braid group.
 +The method can be extended to exchangeable and
 +composite braids and to Markov equivalence.
 +We also determine the exact location of
 +the eigenvalues of the Burau matrix (for suitable
 +parameter), with those
 +for reducible braids filling a complex disk and
 +for the exchange move a Descartes oval.
 +
 +===== 2023 =====
 +
 +====Continuous Local Strategies for Robotic Formation Problems====
 +===by Barbara Kempkes and Friedhelm Meyer auf der Heide (2012)===
 +
 +  * June 28, 19h KST
 +  * Rakhman Ulzhalgas (KAIST) 
 +
 +
 +===== 2022 =====
 +
 +====Computing with Infinite Objects via Coinductive Definitions====
 +  * June 2, 14h30 KST
 +  * Dieter Spreen (U Siegen)
 +
 +//Abstract://
 +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://kaist.theoryofcomputation.asia/_media/screenshot_2022-06-02_152534.png}}
 ===== 2021 ===== ===== 2021 =====
  
-Currently the seminar is taking place via Zoom, contact [[https://kaist.theoryofcomputation.asia/members#dr_svetlana_selivanova|Svetlana]] for the link.+ 
 + 
 +====Book Review "Governing the Commons" by Elinor Ostrom==== 
 +  * July 9, 16h00, via Zoom  
 +  * 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 for Collective Action// will be of interest to those who seek an understanding of common-pool resources and their self-governance. I am going to present chapter one of the book. Chapter one begins with an examination of the commons and the presentation of three models of the commons. Professor Elinor Ostrom discusses: the tragedy of the commons, the prisoner's dilemma game, and the logic of collective action. Then the Professor concludes with comparison of the Leviathan approach and the privatization approach to the governance of the commons. To these two approaches the professor offers an empirical alternative. I will recommend the book to every human being. It is an interesting and inspiring book. I am looking forward to see you on the meetin
  
 ====Lazy types in iRRAM and computability of Mandelbrot set==== ====Lazy types in iRRAM and computability of Mandelbrot set====
Line 18: Line 73:
  
 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 need extra precision. And if that expensively-calculated expression is actually not used in the program, for example by the use of choose function, it will be a waste of computational resources. Although iRRAM has implemented LAZY_BOOLEAN, we need more laziness to remove that kind of computation. So Sewon introduced the lazy versions of types of iRRAM. I will discuss how I could implement the lazy type with iRRAM. I will also discuss briefly about lazy evaluation using call-by-need with iRRAM. 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 need extra precision. And if that expensively-calculated expression is actually not used in the program, for example by the use of choose function, it will be a waste of computational resources. Although iRRAM has implemented LAZY_BOOLEAN, we need more laziness to remove that kind of computation. So Sewon introduced the lazy versions of types of iRRAM. I will discuss how I could implement the lazy type with iRRAM. I will also discuss briefly about lazy evaluation using call-by-need with iRRAM.
 +
 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. 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.
  
Line 27: Line 83:
 In this talk, I introduce a young academic discipline called Ludology, especially mathematical Ludology which studies and analyzes the game 'playing' using mathematics and computer science. In this area, the formal description of a game is regarded as  a mathematical model which satisfies the rules of the game. I will talk about GDL formalism, its applications, the limitations of GDL and other attempts to formalize a game. In this talk, I introduce a young academic discipline called Ludology, especially mathematical Ludology which studies and analyzes the game 'playing' using mathematics and computer science. In this area, the formal description of a game is regarded as  a mathematical model which satisfies the rules of the game. I will talk about GDL formalism, its applications, the limitations of GDL and other attempts to formalize a 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)