On the ill-posed nature of the algebraic closure of the second power of a set of algorithms for calculating estimates

DOI10.1016/0041-5553(85)90144-2MaRDI QIDQ3738596zbMATH OpenOpenAlexFDO

Authors T. V. Plokhonina

Publication date 1985

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(85)90144-2

zbMATH Keywords

regular problems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms in computer science (68W99)

Recommendations

• On the incompleteness of a model of algorithms for computing estimates
• Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
• The construction of a recognition algorithm in the algebraic closure.
• Correctness criteria for algebraic closures of the estimate-calculating algorithm model
• scientific article; zbMATH DE number 4046972

Cited in

(2)

• On the incompleteness of a model of algorithms for computing estimates
• The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems

This page was built for publication: On the ill-posed nature of the algebraic closure of the second power of a set of algorithms for calculating estimates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738596)