Rational analysis, intractability, and the prospects of `as if'-explanations (Q1709129): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximating MAPs for belief networks is NP-hard and other theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability and approximation of optimization theories of cognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational-level explanation of the speed of goal inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of probabilistic inference using Bayesian belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercomputation and the Physical Church‐Turing Thesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alan Turing: Life and Legacy of a Great Thinker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most probable explanations in Bayesian networks: complexity and tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Physical Church–Turing Thesis: Modest or Bold? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding MAPs for belief networks is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability and the use of heuristics in psychological explanations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768891 / rank
 
Normal rank

Latest revision as of 09:36, 15 July 2024

scientific article
Language Label Description Also known as
English
Rational analysis, intractability, and the prospects of `as if'-explanations
scientific article

    Statements

    Rational analysis, intractability, and the prospects of `as if'-explanations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2018
    0 references
    0 references
    psychological explanation
    0 references
    rational analysis
    0 references
    computational-level theory
    0 references
    intractability
    0 references
    NP-hardness
    0 references
    approximation
    0 references
    0 references