In the present paper, we consider Post-Widder operators and its modified form which preserve test function xr, r ∈ ℕ. We estimate direct results in terms of modulus continuity for operators. Also, some estimates polynomially bounded functions linear combinations are considered. Our improve sense previous original

The characterization of important complexity classes by logical descriptions has been an important and prolific area of Descriptive complexity. However, the central focus of the research has been the study of classes like P, NP, L and NL, corresponding to decision problems (e.g. the characterization of NP by Fagin [5] and of P by Grädel [7]). In contrast, optimization problems have received muc...

Let R be an o-minimal expansion of a real closed field. We show that the definable infinitely Peano differentiable functions are smooth if and only if R is polynomially bounded.

We present a deterministic algorithm that constructs in linear time and space the LZ-End parsing (a variation of LZ77) of a given string over an integer polynomially bounded alphabet. 1998 ACM Subject Classification E.4 Data compaction and compression

We investigate the computational power of continuous-time neural networks with Hoppeld-type units and asymmetric interconnections. We prove that polynomial-size networks with saturated-linear response functions are at least as powerful as polynomially space-bounded Turing machines .

An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is wellknown that the property of recursive randomness is closed under computable permutations. We investigate analogous statements for randomness notions defined by betting strategies that are computable within resource bounds. Suppose that S is a polynomial time...

The genetic algorithm (GA) proposed by J. Holland [10] is a randomized heuristic search method, based on analogy with the genetic mechanisms observed in nature and employing a population of tentative solutions. Different modifications of GA are widely used in the areas of operations research pattern recognition, artificial intelligence etc. (see e.g. [13, 16]). Despite of numerous experimental ...

Hard-determinable property and balanced of tautologies are specified as important properties in the study proof complexities formerly. In this paper hard-determinable studied together. It is shown that some sequences hard determinable have polynomially bounded Frege proofs.

The notions of weak and strong unambiguity of augmented push-down automata are considered and related to unambiguities of circuits. In particular we exhibit circuit classes exactly characterizing polynomially time bounded unambiguous augmented push-down automata.