The notion of linear-time computability is very sensitive to machine model. In this connection, we introduce a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers. NLT is very robust and does not depend on the particular choice of random access computers. Kolmogorov machines, Schonhage machines, random access Turing machines, etc. also compute exactl...