Real number computation through Gray code embedding.
We propose an embedding \(G\) of the unit open interval to the set \({0,1}_{\perp,1}^{\omega}\) of infinite sequences of \({0,1}\) with at most one undefined element. This embedding is based on Gray code and it is a topological embedding with a natural topology on \({0,1}_{\perp,1}^{\omega}\). We also define a machine called an indeterministic multihead Type 2 machine which input/output sequences in \({0,1}_{\perp,1}^{\omega}\), and show that the computability notion induced on real functions through the embedding \(G\) is equivalent to the one induced by the signed digit representation and Type 2 machines. We also show that basic algorithms can be expressed naturally with respect to this embedding.
- A domain-theoretic approach to computability on the real line
- An abstract data type for real numbers
- An abstract data type for real numbers
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 3508476 (Why is no real title available?)
- scientific article; zbMATH DE number 1231567 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 870426 (Why is no real title available?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the definitions of computable real continuous functions
- Real number computability and domain theory
- The Takagi function and its generalization
- Topological properties of real number representations.
- Type 2 recursion theory
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Abstract geometrical computation. V: Embedding computable analysis
- Real number computation with committed choice logic programming languages
- \textsc{Prawf}: an interactive proof system for program extraction
- Intuitionistic fixed point logic
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- A stream calculus of bottomed sequences for real number computation
- Coalgebraic representation theory of fractals
- Unimodal maps as boundary restrictions of two-dimensional full-folding maps
- Properties of domain representations of spaces through dyadic subbases
- Representations of complete uniform spaces via uniform domains
- On finite-time computability preserving conversions
- Logic for exact real arithmetic
- Computing with continuous objects: a uniform co-inductive approach
- Logic for Gray-code computation
- scientific article; zbMATH DE number 7731929 (Why is no real title available?)
- Extracting total Amb programs from proofs
- Independent subbases and non-redundant codings of separable metrizable spaces
- On representations of irrational numbers and the computational complexity of converting between such representations
- Application of the Krawczyk-Moore-Jones algorithm to electric circuit analysis and its further development
This page was built for publication: Real number computation through Gray code embedding.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607300)
