Irrational-based computability of functions
From MaRDI portal
Recommendations
- Computable irrational numbers with representations of surprising complexity
- On the Definition of Computable Function of a Real Variable
- On subrecursive representability of irrational numbers, part II
- On subrecursive representability of irrational numbers
- The Effective Sequence of Uniformities and its Limit as a Methodology in Computable Analysis
Cites work
- A Characterization of Real almost Continuous Functions
- A tutorial on computable analysis
- Computability of a function with jumps: Effective uniformity and limiting recursion
- Computability of probability distributions and distribution functions
- Fine convergence of functions and its effectivization
- scientific article; zbMATH DE number 5761697 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 1344955 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746048 (Why is no real title available?)
- scientific article; zbMATH DE number 1782996 (Why is no real title available?)
- scientific article; zbMATH DE number 908753 (Why is no real title available?)
- Sequential computability of a function. Effective Fine space and limiting recursion
Cited in
(5)- Computable irrational numbers with representations of surprising complexity
- The irrationality exponents of computable numbers
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
- scientific article; zbMATH DE number 6862041 (Why is no real title available?)
- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
This page was built for publication: Irrational-based computability of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097063)