Computational Tractability – Beyond Turing? (Q2800259)

From MaRDI portal
Revision as of 17:35, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    tractability
    0 references
    nilpotent computational universal rewrite system
    0 references
    Lie groups
    0 references
    self-organization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references