In computable mathematics, there are known definitions of computable numbers, computable metric spaces, computable compact sets, and computable functions. A traditional definition of a computable function, however, covers only continuous functions. In many applications (e.g., in phase transitions), physical phenomena are described by discontinuous or multi-valued functions (a.k.a. constraints). In this paper, we provide a physics-motivated definition of computable discontinuous and multi-valued functions, and we analyze properties of this definition
The strong relationship between topology and computations has played a central role in the developme...
Limit computable functions can be characterized by Turing jumps on the inputside or limits on the ou...
One of the main problems of interval computations is computing the range of a given function over gi...
In many practical situations, we would like to compute the set of all possible values that satisfy g...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractGiven a strictly increasing computable sequence of real numbers (with respect to the Euclide...
AbstractBy the sometimes so-called Main Theorem of Recursive Analysis, every computable real functio...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
In the representation approach to computable analysis (TTE) [Grz55, KW85, Wei00], abstract data like...
International audienceIn computable analysis a representation for a space X is a partial surjective ...
In this paper, I present an introduction to computability theory and adopt contemporary mathematical...
In this paper, we show how the questions of what is computable and what is feasibly computable can b...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
The strong relationship between topology and computations has played a central role in the developme...
Limit computable functions can be characterized by Turing jumps on the inputside or limits on the ou...
One of the main problems of interval computations is computing the range of a given function over gi...
In many practical situations, we would like to compute the set of all possible values that satisfy g...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractIn this paper we extend computability theory to the spaces of continuous, upper semi-continu...
AbstractGiven a strictly increasing computable sequence of real numbers (with respect to the Euclide...
AbstractBy the sometimes so-called Main Theorem of Recursive Analysis, every computable real functio...
AbstractWe consider an abstract metric space with a computability structure and an effective separat...
In the representation approach to computable analysis (TTE) [Grz55, KW85, Wei00], abstract data like...
International audienceIn computable analysis a representation for a space X is a partial surjective ...
In this paper, I present an introduction to computability theory and adopt contemporary mathematical...
In this paper, we show how the questions of what is computable and what is feasibly computable can b...
Abstract In this chapter, we show how the questions of what is computable and what is feasibly compu...
The strong relationship between topology and computations has played a central role in the developme...
Limit computable functions can be characterized by Turing jumps on the inputside or limits on the ou...
One of the main problems of interval computations is computing the range of a given function over gi...