Interesting fact about TMs - while their computibility is equivalent to computers, the Big-O time for common algorithms is (possibly much) slower. Many O(n) tas

Interesting fact about TMs - while their computibility is equivalent to computers, the Big-O time for common algorithms is (possibly much) slower. Many O(n) tasks on computers with RAM are O(n^2) on a TM. The only commonality with computers in terms of time complexity is the Polynomial vs. Non-polynomial boundary. The same is true for any model of computation. Despite this equivalence, it's orders of magnitude harder to program a TM than the ugliest assembly language you've ever seen. This is one architecture that desperately needs a compiler :)