Article
Licensed
Unlicensed
Requires Authentication
Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
-
A. N. Cherepov
Published/Copyright:
December 9, 2008
Abstract
We consider determinate functions with delay which are generalisations of determinate functions and introduce the notion of complexity of an ɛ-approximation of a continuous real function by a function with delay. For some classes of continuous functions for which estimates of the number of elements in the 2ɛ-distinguishable set of functions are known, upper and lower estimates are obtained.
Received: 2007-11-28
Published Online: 2008-12-09
Published in Print: 2008-December
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On stability of a vector combinatorial problem with MINMIN criteria
- On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
- Characteristics of random systems of linear equations over a finite field
- On the realisation of Boolean functions by informational graphs
- Estimates of the number of occurrences of vectors on cycles of linear recurring sequences over a finite field
- Finite generability of some groups of recursive permutations
- Independent systems of generators and the Hopf property for unary algebras
- Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
- On ranks, Green classes, and the theory of determinants of Boolean matrices
Articles in the same Issue
- On stability of a vector combinatorial problem with MINMIN criteria
- On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
- Characteristics of random systems of linear equations over a finite field
- On the realisation of Boolean functions by informational graphs
- Estimates of the number of occurrences of vectors on cycles of linear recurring sequences over a finite field
- Finite generability of some groups of recursive permutations
- Independent systems of generators and the Hopf property for unary algebras
- Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
- On ranks, Green classes, and the theory of determinants of Boolean matrices
