Computational Tractability – Beyond Turing? (Q2800259)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational Tractability – Beyond Turing?
scientific article

    Statements

    Computational Tractability – Beyond Turing? (English)
    0 references
    0 references
    0 references
    15 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tractability
    0 references
    nilpotent computational universal rewrite system
    0 references
    Lie groups
    0 references
    self-organization
    0 references
    0 references