I can't decide...

• Undecidability and mounds to the moon

  • MalCode problems are almost all undecidable
  • Typical proposed solution:
    • Identify a finite number of patterns to match
    • Increase the number to show improvement
  • My interpretation:
    • 125/infinity -> 250/infinity ~= 0 -> 0
  • You cannot get to the moon by building bigger and bigger mounds of dirt
  • Any proposal better cover infinite subspaces

Notes: