Article
Licensed
Unlicensed
Requires Authentication
On approximation of continuous functions by determinate functions with delay
-
A. N. Cherepov
Published/Copyright:
March 18, 2010
Abstract
We consider determinate functions with delay which are extensions of determinate functions and find some properties of these functions. The problem is posed to approximate continuous functions by functions with delay, and the assertion is proved that it is possible to approximate any continuous function with an arbitrary accuracy. Approximations for some functions are given, including the addition and multiplication functions which are minimal from the delay viewpoint.
Received: 2008-06-11
Published Online: 2010-03-18
Published in Print: 2010-March
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
Articles in the same Issue
- On approximation of continuous functions by determinate functions with delay
- Fast algorithms for elementary operations on complex power series
- On the complexity of the ℰ2 Grzegorczyk class
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On bounds for complexity of circuits of multi-input functional elements
- Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
- On the finite near-rings generated by endomorphisms of an extra-special 2-group
