This is an expository paper about the Borel complexity of structure and classification theorems. It sorts several classical problems relative to known benchmarks of complexity. As a corollary various problems proposed by people such as von Neumann and Smale are shown to be infeasible using inherently countable information
International audienceWe define the notion of localizable property for a dynamical system. Then we s...
We consider dynamical systems for which the spatial extension plays an important role. For these sys...
AbstractWe consider the computational complexity of languages of symbolic dynamical systems. In part...
AbstractThis is a survey of recent results on the notion of symbolic complexity, which counts the nu...
Abstract: Here we turn onto the predicting task. The purpose of this paper is much of the...
ch notions. (1--8) On the one hand, this variety reflects the fact that dynamics of systems contai...
In this chapter we aim at presenting applications of notions from Information Theory to the study of...
This volume presents four machine-independent theories of computational complexity, which have been ...
We argue that a critical difference distinguishing machines from organisms and computers from brains...
Complexity of a dynamical system is defined as a function of the morphology and the information entr...
This paper presents a theory that enables to interpret natural processes as special purpose analog c...
AbstractThis paper discusses the scope and goals of structural complexity theory, describes some wor...
This book comprises an impressive collection of problems that cover a variety of carefully selected ...
We construct a complexity measure from first principles, as an average over the ‘‘obstruction agains...
AbstractWe discuss complexity measures which are obtained as norms of vectors whose components are n...
International audienceWe define the notion of localizable property for a dynamical system. Then we s...
We consider dynamical systems for which the spatial extension plays an important role. For these sys...
AbstractWe consider the computational complexity of languages of symbolic dynamical systems. In part...
AbstractThis is a survey of recent results on the notion of symbolic complexity, which counts the nu...
Abstract: Here we turn onto the predicting task. The purpose of this paper is much of the...
ch notions. (1--8) On the one hand, this variety reflects the fact that dynamics of systems contai...
In this chapter we aim at presenting applications of notions from Information Theory to the study of...
This volume presents four machine-independent theories of computational complexity, which have been ...
We argue that a critical difference distinguishing machines from organisms and computers from brains...
Complexity of a dynamical system is defined as a function of the morphology and the information entr...
This paper presents a theory that enables to interpret natural processes as special purpose analog c...
AbstractThis paper discusses the scope and goals of structural complexity theory, describes some wor...
This book comprises an impressive collection of problems that cover a variety of carefully selected ...
We construct a complexity measure from first principles, as an average over the ‘‘obstruction agains...
AbstractWe discuss complexity measures which are obtained as norms of vectors whose components are n...
International audienceWe define the notion of localizable property for a dynamical system. Then we s...
We consider dynamical systems for which the spatial extension plays an important role. For these sys...
AbstractWe consider the computational complexity of languages of symbolic dynamical systems. In part...