TheoCS Refactorization

• Merge TheoCs's notion of recursive enumerability with that of Complexity

• Decision problem:

  • clean it up by relating it to computational problem (we might need to mix decision procedure in as well)
  • then there might occur a view to TheoCS's formal language definition of decision problems (cf. 1.03 in theocs#5)

• mod/pnp.en and mod/pnp.de -> split in one module per complexity class

• Add adjectives X-complete and X-hard in complexity (cf. 1.14 in theocs#5)

• Complexity classes: Refactor "constant", "logarithmic" etc. and connect them with the appropriate complexity classes

• Time-space complexity: There's a view somewhere...

• TMs: Think about merging them with the notion of TMs in TheoCS, but keep the actual work for later