Add to ORKGIt is shown that a function is computable by an on-the- y algorithm pro-cessing data in the most signicant digit rst fashion with a nite number of registers if and only if it is computable by a right subsequential nite state ma-chine processing deterministically data in the least signicant digit rst fashion. Some applications to complex radix number systems are given
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Abstract. An $(m, n) $-computation of a function $f $ is given by a deterministic Turing machine whi...
This paper investigates an arithmetic based upon the representation of computable exact real numbers...
AbstractA reasonable computational complexity theory for real functions is obtained by using the mod...
AbstractThis paper investigates an arithmetic based upon the representation of computable exact real...
In this paper we define the notion of an abstract (Z, Q)-machine, which is a mathematical model for ...
A sequential machine is “consistent” iff when both the input and output strings of symbols are regar...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractWe consider the real sequences in I=[0,1) and real functions on I. A computability notion wi...
The notion of linear-time computability is very sensitive to machine model. In this connection, we i...
Naive computations with real numbers on computers may cause serious errors. In traditional numerical...
In this paper we explore the computational complexity measure defined by running times of programs o...
Multiplication of two numbers represented in base is shown to be computable by an on-line algorith...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Abstract. An $(m, n) $-computation of a function $f $ is given by a deterministic Turing machine whi...
This paper investigates an arithmetic based upon the representation of computable exact real numbers...
AbstractA reasonable computational complexity theory for real functions is obtained by using the mod...
AbstractThis paper investigates an arithmetic based upon the representation of computable exact real...
In this paper we define the notion of an abstract (Z, Q)-machine, which is a mathematical model for ...
A sequential machine is “consistent” iff when both the input and output strings of symbols are regar...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
In this thesis we examine some of the central problems in the theory of computational complexity, l...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractWe consider the real sequences in I=[0,1) and real functions on I. A computability notion wi...
The notion of linear-time computability is very sensitive to machine model. In this connection, we i...
Naive computations with real numbers on computers may cause serious errors. In traditional numerical...
In this paper we explore the computational complexity measure defined by running times of programs o...
Multiplication of two numbers represented in base is shown to be computable by an on-line algorith...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Abstract. An $(m, n) $-computation of a function $f $ is given by a deterministic Turing machine whi...
This paper investigates an arithmetic based upon the representation of computable exact real numbers...