# Whatever that can be done using algorithm can be done using Turing machine

In 1937 how was Alan Turing so sure that all that can be done using algorithms can be implemented using a Turing machine? Since that period many new algorithms were implemented. What was his hypothesis behind this theory ?

• Did you read Turing's 1936 paper "On computable numbers" (e.g. here)? Paragraph 9 addresses exactly this question and is quite clear and readable. – cody Apr 26 '16 at 17:24
• Common researcher's reasoning: "I'm an expert and I can not imagine a way. So I conjecture it's impossible." – Raphael Apr 27 '16 at 11:12