In this mini-survey we discuss time complexity and program size results for universal Turing machines, tag systems, cellular automata, and other simple models of computation. We discuss results that show that many of the simplest known models of computation including the smallest known universal Turing machines and the elementary cellular automaton Rule 110 are efficient simulators of Turing machines. We also recall a recent result where the halting problem for tag systems with only 2 symbols (the minimum possible) is proved undecidable. This result has already yielded applications including a significant improvement on previous undecidability bounds for the Post correspondence problem and the matrix mortality problem.