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

From MaRDI portal
Created claim: Wikidata QID (P12): Q51652261, #quickstatements; #temporary_batch_1706518640034
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:35, 8 February 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

    The complexity of proving chaoticity and the Church–Turing thesis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2015
    0 references
    0 references
    0 references