@Article{ABA:04:SimpleSets,
  author =       "Amir M. Ben-Amram",
  year =         "2004",
  title =        "A Complexity-Theoretic Proof of a Recursion-Theoretic Theorem",
  journal =      "SIGACT News",
  volume =       "35",
  number =       "2",
  pages =        "111--112",
  month =        jun,
  keywords =     "simple set",
  summary =      "This note provides an example where tools from
  Complexity Theory simplify the proof of a classic Recursion-Theoretical
  result. Specifically, we prove that a simple set cannot be RE-complete."
}