Computational tractability -- beyond Turing? (Q2800259)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6569275
Language Label Description Also known as
default for all languages
No label defined
    English
    Computational tractability -- beyond Turing?
    scientific article; zbMATH DE number 6569275

      Statements

      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
      Computational tractability -- beyond Turing? (English)
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references