CWI Seminar Control and System Theory - 2009 Spring

• Aims of seminar
• Topic of current semester
• Program and schedule
• References
• Travel directions
• Contact information

For the topic of previous semesters see:

• Seminar Control and System Theory - Program Fall 2008.
• Seminar Control and System Theory - Program Spring 2008.
• Seminar Control and System Theory - Program Fall 2007.
• Seminar Control and System Theory - Program Spring 2007.

• Tuesday 20 January 2009.
  Subject: Type-Two Effectivity.
  Outline: Turing machines, type-two computation, topology on sequence spaces, continuity of computable functions on sequences, universal Turing machine, smn theorem, notations and representations, tupling, standard and admissible representations, continuity of computable functions.
  Reference: Book K. Weihrauch, "Computable Analysis", Chapters 2 & 3.
  Speaker: Pieter Collins.
• Tuesday 3 February 2009.
  Subject: Computability Theory for the Real Numbers.
  Outline: Deficiencies of binary/decimal representations, Cauchy and interval representations, computability of arithmetic, uncomputability of equality, lower and upper representations, uniqueness of canonical representation, computability of real functions, computability of analytic functions, signed-digit representation, complexity of arithmetic in the signed-digit representation.
  Reference: Book K. Weihrauch, "Computable Analysis", Chapters 4 & 7.2.
  Speaker: Jana Nemcova
• Tuesday 17 February 2009.
  Subject: Computability Theory for Sets in Euclidean Space.
  Outline: Basis of rational boxes, representations of points and sets, computability of operations on sets.
  Reference: Book K. Weihrauch, "Computable Analysis", Chapter 5.
  Speaker: Ivan Zapreev
• Tuesday 3 March 2009, 09:30 - 11:45 hours .
  Cancelled. Moved to 10 March.
• Tuesday 10 March 2009, 14:00 - 16:15 hours .
  Subject: Computability Theory for Euclidean Functions.
  Outline: Compact-open representation of continuous functions, Semicontinuous multivalued functions, computability for semicontinuous functions, application to computation of reachable, viable, invariant and controllable sets for discrete-time systems.
  References: Book K. Weihrauch, "Computable Analysis", Chapter 6. P. Collins, "Continuity and Computability of Reachable Sets", Theoretical Computer Science 341 (2005) 162-195.
  Speaker: Lorenzo Sella
• Tuesday 17 March 2009, 14:00 - 16:15 hours .
  Subject: Computable Type Theory for Quotients of Countably Based Spaces
  Outline: Motivation of a higher level type theory. Cartesian closed categories and lambda calculus. The Scott topology. Overt and compact set types. Continuous operators.
  References: I. Battenfeld, M. Matthias Schroeder and A. Simpson, "A Convenient Category of Domains", Electronic Notes in Theoretical Computer Science 172 (2007) 69-99. M. Escardo, "Synthetic Topology of Data Types and Classical Spaces", Electronic Notes in Theoretical Computer Science 87 (2004) 21-156. P. Collins, "Computable Types for Dynamic Systems", Preprint.
  Speaker: Pieter Collins
• Tuesday 31 March 2009. 09:45 - 11:30 hours. Room M280 by exception.
  Subject: Computability of Solutions of Differential Systems .
  Outline: Computability of solutions of differential equations, differential inclusions and differential-algebraic equations..
  Reference: P. Collins and D. Graca, "Computability of Solutions of Differential Inclusions - The Ten Thousand Monkeys Approach", Preprint.
  Speaker: Pieter Collins
• Tuesday 14 April 2009.
  Subject: .
  Outline: .
  Reference:
  Speaker:
• Tuesday 28 April 2009.
  Subject:
  Outline: .
  Reference:
  Speaker: Pieter Collins.
• Tuesday 12 May 2009.
  Subject: Computability Theory for Hybrid Systems.
  Outline: Computability of solutions of hybrid systems. Computable semantics for hybrid modelling languages.
  Reference: .
  Speaker: Jan H. van Schuppen.
• Tuesday 26 May 2009.
  Subject: Computable Algebraic Topology
  Outline: Computability of the fixed point set using the Lefschetz/Brouwer index. Computability of homology. Computability of orbits using the Conley index..
  Reference: Lorenzo Sella
  Speaker:
• Tuesday 9 June 2009.
  Subject: Practical implementation of computable analysis.
  Outline: Implementation approaches - approximate or exact data types. Approximate data types - pavings and Taylor models. Algorithms - interval Newton, robust (non)linear programming, Lohner.
  Reference: .
  Speaker: Sanja Zivanovic
• Tuesday 23 June 2009.
  Subject:
  Outline: .
  Reference: .
  Speaker:

• K. Weihrauch, Computable Analysis - An Introduction, Texts in Theorectical Computer Science, Springer-Verlag, Berlin, 2000.

• Pieter Collins, "Continuity and Computability of Reachable Sets", Theor. Comput. Sci. 341, 162--195, 2005.