Article
Licensed
Unlicensed
Requires Authentication
On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions
-
V. A. Buevich
Published/Copyright:
June 22, 2013
Abstract
It is well known that the problem on A-completeness of finite systems of b.d. functions is algorithmically unsolvable in the general case. Nevertheless, the criterion for A-completeness admits a formulation in terms of A-precomplete classes, and the set of A-precomplete classes is described efficiently. We consider systems of b.d. functions containing all S-b.d. functions depending on one variable and demonstrate that there exists an algorithm to recognise the A-completeness of such systems.
Published Online: 2013-06-22
Published in Print: 2012-10
© 2013 by Walter de Gruyter GmbH & Co.
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- On the algebras of almost minimal rank
- Definition of positively closed classes by endomorphism semigroups
- The power conjugacy search problem in a cyclic subgroup in groups with the condition C.3/ & T.6/
- Lawvere intervals and the Möbius function of a Möbius category
- On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions
- On uniqueness of alphabetic decoding
- On unstable branching graphs
- Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
- Statistical problems on random permutations with censored data
- On large deviations of branching processes in a random environment with arbitrary initial number of particles: critical and supercritical cases
- Multitype branching processes evolving in a Markovian environment
- On solutions and algebraic duality of generalised linear discrete time systems
- On the number of Gram’s intervals containing the ordinates of successive zeros of the Riemann zeta function
Articles in the same Issue
- Masthead
- On the algebras of almost minimal rank
- Definition of positively closed classes by endomorphism semigroups
- The power conjugacy search problem in a cyclic subgroup in groups with the condition C.3/ & T.6/
- Lawvere intervals and the Möbius function of a Möbius category
- On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions
- On uniqueness of alphabetic decoding
- On unstable branching graphs
- Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
- Statistical problems on random permutations with censored data
- On large deviations of branching processes in a random environment with arbitrary initial number of particles: critical and supercritical cases
- Multitype branching processes evolving in a Markovian environment
- On solutions and algebraic duality of generalised linear discrete time systems
- On the number of Gram’s intervals containing the ordinates of successive zeros of the Riemann zeta function
