Titlebook: Reachability Problems; Third International Olivier Bournez,Igor Potapov Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009

LATER

Reachability for Continuous and Hybrid Systems,In this talk I present some past, present and future work concerning reachability computation for continuous and hybrid systems.

Affiliation

Algorithmic Information Theory and Foundations of Probability,The question how and why mathematical probability theory can be applied to the “real world” has been debated for centuries. We try to survey the role of algorithmic information theory (Kolmogorov complexity) in this debate.

Alopecia-Areata

An Undecidable Permutation of the Natural Numbers,In this paper, an undecidability result concerning a permutation of natural numbers is presented. More precisely, it is shown that for a certain piecewise defined permutation, which consists of five affine transformations, it is undecidable whether a given number belongs to a finite cycle or not.

帶來(lái)

The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane,In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov, see [3]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.

敵意