International audienceComputable analysis is the theoretical study of the abilities of algorithms to process infinite objects. The algorithms abilities depend on the way these objects are presented to them. We survey recent results on the problem of identifying the properties of objects that are decidable or semidecidable, for several concrete classes of objects and representations of them. Topology is at the core of this study, as the decidable and semidecidable properties are closely related to the open sets induced by the representation
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractIn this paper we investigate aspects of effectivity and computability on partial continuous ...
We investigate the topological aspects of some algebraic computation models, in particular the BSS-m...
International audienceIn computability theory and computable analysis, finite programs can compute i...
In computability theory and computable analysis, finite programs can compute infinite objects. Prese...
International audienceIn computability theory and computable analysis, finite programs can compute i...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
Computable analysis provides a formalization of algorithmic computations over infinite mathematical ...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
AbstractIn the context of possibly infinite computations yielding finite or infinite (binary) output...
International audienceComputable analysis uses representations to encode elements of abstract mathem...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
International audienceComputable analysis provides ways of representing points in a topological spac...
AbstractWe give a new definition of admissible representations which allows to handle also non count...
International audienceIn computability theory many results state the existence of objects that in ma...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractIn this paper we investigate aspects of effectivity and computability on partial continuous ...
We investigate the topological aspects of some algebraic computation models, in particular the BSS-m...
International audienceIn computability theory and computable analysis, finite programs can compute i...
In computability theory and computable analysis, finite programs can compute infinite objects. Prese...
International audienceIn computability theory and computable analysis, finite programs can compute i...
AbstractA concrete model of computation for a topological algebra is based on a representation of th...
Computable analysis provides a formalization of algorithmic computations over infinite mathematical ...
We revise and extend the foundation of computable topology in the framework of Type-2 theory of effe...
AbstractIn the context of possibly infinite computations yielding finite or infinite (binary) output...
International audienceComputable analysis uses representations to encode elements of abstract mathem...
The TTE approach to Computable Analysis is the study of so-calledrepresentations (encodings for cont...
International audienceComputable analysis provides ways of representing points in a topological spac...
AbstractWe give a new definition of admissible representations which allows to handle also non count...
International audienceIn computability theory many results state the existence of objects that in ma...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractIn this paper we investigate aspects of effectivity and computability on partial continuous ...
We investigate the topological aspects of some algebraic computation models, in particular the BSS-m...