Divergence bounded computable real numbers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1183247 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1747708 (Why is no real title available?)
- scientific article; zbMATH DE number 1746031 (Why is no real title available?)
- scientific article; zbMATH DE number 1850721 (Why is no real title available?)
- scientific article; zbMATH DE number 3066801 (Why is no real title available?)
- A characterization of c. e. random reals
- Cohesive sets and recursively enumerable Dedekind cuts
- Mathematical Foundations of Computer Science 2003
- Nicht konstruktiv beweisbare Sätze der Analysis
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the Turing Degrees of Weakly Computable Real Numbers
- On the hierarchy and extension of monotonically computable real numbers.
- Weakly computable real numbers
Cited in
(9)- h-monotonically computable real numbers
- New Computational Paradigms
- On the divergence bounded computable real numbers
- Classification of computably approximable real numbers
- Computability of Real Numbers
- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
- Classification of the computable approximations by divergence boundings
- Finitely bounded effective computability
- scientific article; zbMATH DE number 2089959 (Why is no real title available?)
This page was built for publication: Divergence bounded computable real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817855)