Add to ORKGIn this paper we propose a model-theoretic characterisation of computable metric spaces and computability over them in a finite language
We investigate the expressive power and computational properties of two different types of languages...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractIn computable analysis recursive metric spaces play an important role, since these are, roug...
We investigate conditions under which a co-computably enumerable closed setin a computable metric sp...
AbstractBased on standard notions of classical recursion theory, a natural model of approximate comp...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
A semi-computable set S in a computable metric space need not be computable.However, in some cases, ...
AbstractData such as real and complex numbers, discrete and continuous time data streams, waveforms,...
This book is aimed at providing an introduction to the basic models of computability to the undergra...
© 2016, Allerton Press, Inc.In the present paper we obtain new main metric invariants of finite metr...
Abstract. We introduce infinite time computable model theory, the com-putable model theory arising w...
We investigate the expressive power and computational properties of two different types of languages...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...
AbstractIn computable analysis recursive metric spaces play an important role, since these are, roug...
We investigate conditions under which a co-computably enumerable closed setin a computable metric sp...
AbstractBased on standard notions of classical recursion theory, a natural model of approximate comp...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
We investigate conditions under which a co-computably enumerable set in acomputable metric space is ...
AbstractEvery second-countable regular topological space X is metrizable. For a given “computable” t...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
A semi-computable set S in a computable metric space need not be computable.However, in some cases, ...
AbstractData such as real and complex numbers, discrete and continuous time data streams, waveforms,...
This book is aimed at providing an introduction to the basic models of computability to the undergra...
© 2016, Allerton Press, Inc.In the present paper we obtain new main metric invariants of finite metr...
Abstract. We introduce infinite time computable model theory, the com-putable model theory arising w...
We investigate the expressive power and computational properties of two different types of languages...
Abstract: We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), ...
AbstractThe notions “recursively enumerable” and “recursive” are the basic notions of effectivity in...