@Article{benamramjones99,
  author =       "A. Ben-Amram and N. D. Jones",
  year =         "1999",
  title =        "A precise version of a time hierarchy theorem",
  journal =      "Fundamenta Informaticae",
  volume =       "38",
  pages =        "1--15",
  note =         "Special issue dedicated to {A}rto {S}alomaa",
  keywords =     "time complexity, hierarchy theorem, universal
                 program",
  summary =      "Using a simple programming language as a computational
                 model, Neil Jones has shown that a constant-factor time
                 hierarchy exists: thus a constant-factor difference in
                 time makes a difference in problem-solving power,
                 unlike the situation with Turing machines. In this note
                 we review this result and fill in the details of the
                 proof, thus obtaining a {\em precise version} of the
                 theorem with explicit constant factors. Specifically,
                 multiplying the running time by 232 provably allows
                 more decision problems to be solved.",
  puf =          "Artikel optaget i tidsskrift",
}