Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2005.06.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127920721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Costs of general purpose learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of identification criteria for machine inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on structure and looking back applied to the relative complexity of computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexings of subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of sets in NP and other complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Gödel Numberings, Isomorphisms, and Programming Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-complexity pairing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursion-theoretic structure of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to obtain diagonal sets in complexity classes / rank
 
Normal rank

Latest revision as of 12:10, 24 June 2024

scientific article
Language Label Description Also known as
English
Generality's price: Inescapable deficiencies in machine-learned programs
scientific article

    Statements

    Generality's price: Inescapable deficiencies in machine-learned programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Computational learning theory
    0 references
    Applications of computability theory
    0 references

    Identifiers