If we only consider problems in P, are there any bigs gaps between the fastest known word-RAM algorithm and the fastest known Turing machine algorithm?