On the power of recursive optimizers
From MaRDI portal
Publication:1114401
DOI10.1016/0304-3975(88)90071-0zbMath0662.68044OpenAlexW2068651050MaRDI QIDQ1114401
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90071-0
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) General topics in the theory of software (68N01)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Nonexistence of program optimizers in several abstract settings
- Tradeoffs in the inductive inference of nearly minimal size programs
- ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
- Periodicity in generations of automata
- Computational complexity of formal translations
- Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
- Toward a mathematical theory of inductive inference
- Inductive inference of automata, functions and programs
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the size of machines
- An Overview of the Theory of Computational Complexity
- On Effectively Computable Operators
- Language identification in the limit
- Computational Complexity and the Existence of Complexity Gaps
- Recursive Properties of Abstract Complexity Classes
This page was built for publication: On the power of recursive optimizers