Computational Complexity Via Finite Types (Q2946764)

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 6483255
Language Label Description Also known as
default for all languages
No label defined
    English
    Computational Complexity Via Finite Types
    scientific article; zbMATH DE number 6483255

      Statements

      Computational Complexity Via Finite Types (English)
      0 references
      0 references
      17 September 2015
      0 references
      finite types
      0 references
      System T
      0 references
      complexity classes
      0 references
      higher-order primitive recursion
      0 references
      memoization
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers