The complexity of proving chaoticity and the Church–Turing thesis (Q5251233): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and incompleteness in classical mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical system where proving chaos is equivalent to proving Fermat's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horseshoes in perturbations of Hamiltonian systems with two degrees of freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Unentscheidbare Probleme Der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A notion of mechanistic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank

Latest revision as of 03:13, 10 July 2024

scientific article; zbMATH DE number 6437391
Language Label Description Also known as
English
The complexity of proving chaoticity and the Church–Turing thesis
scientific article; zbMATH DE number 6437391

    Statements