◾ Time Complexity ◾

Time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.

Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform.

Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to differ by at most a constant factor.

Algorithmic complexities are classified according to the type of function appearing in the big O notation.

#ProgrammerPlus

🔸 Turing Machine 🔸

A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.

Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed.

The Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine).

#ProgrammerPlus