#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1953

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Petr Kurka
- Theor. Comput. Sci.
- 1997

- François Blanchard, Enrico Formenti, Petr Kurka
- Complex Systems
- 1997

The Besicovitch and Weyl pseudometrics on the space AŸ of biinfinite sequences measure the density of differences in either the central or arbitrary segments of given sequences. The Besicovitch and Weyl spaces are obtained from A by factoring through the equivalence of zero distance. Cellular automata are considered as dynamical systems on the Besicovitch… (More)

- Petr Kurka
- Fundam. Inform.
- 2003

- Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel
- Fundam. Inform.
- 2006

Many different definitions of computational universality for various types of dynamical systems have flourished since Turing’s work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as undecidability of a model-checking problem. For Turing machines,… (More)

- Petr Kurka, Alejandro Maass
- Fundam. Inform.
- 2002

- Petr Kurka
- Encyclopedia of Complexity and Systems Science
- 2009

- Petr Kurka
- 2007

1 Glossary Almost equicontinuous CA has an equicontinuous configuration. Attractor: omega-limit of a clopen invariant set. Blocking word interrupts information flow. Closing CA: distinct asymptotic configurations have distinct images. Column subshift: columns in space-time diagrams. Cross section: one-sided inverse map. ∗Université de Nice Sophia Antipolis,… (More)

- Petr Kurka
- Theor. Comput. Sci.
- 2014

An interval number system is given by an initial interval cover of the extended real line and by a finite system of nonnegative Möbius transformations. Each sequence of transformations applied to an initial interval determines a sequence of nested intervals whose intersection contains a unique real number. We adapt in this setting exact real algorithms… (More)

Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It… (More)

- Enrico Formenti, Petr Kurka
- Encyclopedia of Complexity and Systems Science
- 2009