Capacity of algebraic extensions of a model of estimate-computing algorithms

DOI10.1016/0041-5553(84)90011-9MaRDI QIDQ3711784zbMATH OpenOpenAlexFDO

Authors V. L. Matrosov

Publication date 1984

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(84)90011-9

zbMATH Keywords

Algebras of computable operations

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds of the capacity of algebras of estimate-computing algorithms
• The capacity of polynomial expansions of a set of algorithms for calculating estimates
• scientific article; zbMATH DE number 3858454
• On the incompleteness of a model of algorithms for computing estimates
• Computing Logarithmic Capacity with Linear Programming

Cited in

(4)

• scientific article; zbMATH DE number 3858454 (Why is no real title available?)
• Lower bounds of the capacity of algebras of estimate-computing algorithms
• The capacity of polynomial expansions of a set of algorithms for calculating estimates
• On the efficiency and capacity of computers

This page was built for publication: Capacity of algebraic extensions of a model of estimate-computing algorithms

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