Very important to know,

In 1936 mathematician Alan Turing proved in his famous research paper “On computable numbers” that, “If an algorithm can be written to solve a mathematical problem, then a Turing machine can execute that algorithm”.

This is a very fundamental and important theory in Computer Science and Engineering(CSE).

That means in a simpler word that :

Any project may be very complex or easy, can be done if first of all, we are able to design an algorithm (description + flowchart + pseudocode).

Though it is hard to convert a design to code, possible if there is a design/blueprint first means algorithm.

The algorithm should be the first thing to learn in the case of CSE.

#research #short-read #ideas #algorithms