I'm studying with the book computability and logic(boolos).
In chapter 5, the theorem is proved, indirectly, by showing that (recursive => abacus) & (abacus=> turing). But I want to prove (recursive=>turing) without abacus machines but I think this is not easy. So I think I need some nice references for this.