AbstractLet β be a real number >1. The digit set conversion between real numbers represented in fixed base β is shown to be computable by an on-line algorithm, and thus is a continuous function. When β is a Pisot number the digit set conversion is computable by an on-line finite automaton
Peoples over the ages use different counting systems. Appling that to cryptography, we use to repres...
AbstractWe investigate the representation of real numbers by sequences of digits, thought of as radi...
In recent years, there has been a considerable amount of work on using continuous domains in real an...
Multiplication of two numbers represented in base is shown to be computable by an on-line algorith...
AbstractThis is an investigation into exact real number computation using the incremental approach o...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
: We develop a formal account of digit serial number representations by describing them as strings f...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
We present the different constructive definitions of real number that can be found in the literature...
AbstractWe examine a special case of admissible representations of the closed interval, namely those...
International audienceWe describe here a representation of computable real numbers and a set of algo...
This article studies the expressive power of finite automata recognizing setsof real numbers encoded...
This article studies the expressive power of finite-state automata recognizing sets of real numbers ...
AbstractA reasonable computational complexity theory for real functions is obtained by using the mod...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
Peoples over the ages use different counting systems. Appling that to cryptography, we use to repres...
AbstractWe investigate the representation of real numbers by sequences of digits, thought of as radi...
In recent years, there has been a considerable amount of work on using continuous domains in real an...
Multiplication of two numbers represented in base is shown to be computable by an on-line algorith...
AbstractThis is an investigation into exact real number computation using the incremental approach o...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
: We develop a formal account of digit serial number representations by describing them as strings f...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
We present the different constructive definitions of real number that can be found in the literature...
AbstractWe examine a special case of admissible representations of the closed interval, namely those...
International audienceWe describe here a representation of computable real numbers and a set of algo...
This article studies the expressive power of finite automata recognizing setsof real numbers encoded...
This article studies the expressive power of finite-state automata recognizing sets of real numbers ...
AbstractA reasonable computational complexity theory for real functions is obtained by using the mod...
AbstractIn recent years, there has been a considerable amount of work on using continuous domains in...
Peoples over the ages use different counting systems. Appling that to cryptography, we use to repres...
AbstractWe investigate the representation of real numbers by sequences of digits, thought of as radi...
In recent years, there has been a considerable amount of work on using continuous domains in real an...
DOI
Add to ORKG