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 ?
The hypotesis is the following:

"Since an algorithm is a well-defined sequence of steps we can always execute an algorithm in a piece of paper(sometimes we may need a really big paper) using a pencil."

Then he created the Turing Machine who can simulate a hand using a pencil with an infinite paper.