C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2012, Article 07, pages 1–24 http://cjtcs.cs.uchicago.edu/ Computational Models with No Linear Speedup Amir M. Ben-Amram

Source URL: cjtcs.cs.uchicago.edu

• Computability theory
• Computational complexity theory
• Computational resources
• Models of computation
• Linear speedup theorem
• Universal Turing machine
• Speedup theorem
• DTIME
• Time complexity
• Theoretical computer science
• Applied mathematics
• Turing machine