A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems (Q3866085)

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 3668573
Language Label Description Also known as
default for all languages
No label defined
    English
    A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems
    scientific article; zbMATH DE number 3668573

      Statements

      A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems (English)
      0 references
      0 references
      1979
      0 references
      algorithmic systems
      0 references
      decision problems
      0 references
      many-one equivalence
      0 references
      recursive reduction
      0 references
      register machine
      0 references
      Markov algorithm
      0 references
      semi-Thue system
      0 references
      Turing machine
      0 references
      Post normal calculus
      0 references
      representation theorems
      0 references
      partial implicational propositional calculus in two variables
      0 references
      word problem of Thue systems
      0 references
      recursive classes of first-order logical formulae with equality
      0 references
      partial recursive functions
      0 references

      Identifiers

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