Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userConditional computability of real functions with respect to a class of operators
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this class. These two computability notions are natural generalizations of certain notions introduced in a previous paper co-authored by Andreas Weiermann and in another previous paper by the same authors, respectively. Under certain weak assumptions about the class in question, we show that conditional computability is preserved by substitution, that all conditionally computable real functions are locally uniformly computable, and that the ones with compact domains are uniformly computable. The introduced notions have some similarity with the uniform computability and its non-uniform extension considered by Katrin Tent and Martin Ziegler, however, there are also essential differences between the conditional computability and the non-uniform computability in question.
rate research
Read More
The paper considers quantitati
We prove that, for every theory $T$ which is given by an ${mathcal L}_{omega_1,omega}$ sentence, $T$ has less than $2^{aleph_0}$ many countable models if and only if we have that, for every $Xin 2^omega$ on a cone of Turing degrees, every $X$-hyperarithmetic model of $T$ has an $X$-computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaughts conjecture.
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures and the integrable functions on such spaces. For functions f,g on represented sets, f is W-reducible to g if f can be computed by applying the function g at most once. Let RN be the Radon-Nikodym operator on the space under consideration and let EC be the non-computable operator mapping every enumeration of a set of natural numbers to its characteristic function. We prove that for every computable measurable space, RN is W-reducible to EC, and we construct a computable measurable space for which EC is W-reducible to RN.
The TTE computability notion in effective metric spaces is usually defined by using Cauchy representations. Under some weak assumptions, we characterize this notion in a way which avoids using the representations.
Let $mathfrak{n}$ be a nonempty, proper, convex subset of $mathbb{C}$. The $mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $mathfrak{n}$ and are maximal with this property. Typical examples of these are the maximal symmetric (or accretive or dissipative) operators, the associated to some sesquilinear forms (for instance, to closed sectorial forms), and the generators of some strongly continuous semi-groups of bounded operators. In this paper the $mathfrak{n}$-maximal operators are studied and some characterizations of these in terms of the resolvent set are given.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
