Login / Signup

Is P = PSPACE for Infinite Time Turing Machines?

Joost Winter
Published in: ILC (2007)
Keyphrases
  • turing machine
  • decision procedures
  • temporal logic
  • finite sets
  • decision trees
  • modal logic
  • complexity bounds
  • mazurkiewicz traces