Login / Signup

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes.

Harry B. Hunt III
Published in: J. ACM (1984)
Keyphrases
  • turing machine
  • learning algorithm
  • artificial intelligence
  • np complete
  • decision problems
  • computational complexity
  • evolutionary algorithm
  • computational cost
  • description logics
  • np hardness
  • computational issues