Please enable JavaScript.
Coggle requires JavaScript to display documents.
21/07/23 - Coggle Diagram
21/07/23
Computer
Alan Turing. 1937.
Turing Machine
Jon Von Neumann. 1947.
Billions of switches
Problem
Algorithm
Set of instructions to solve a problem.
Provided an input, and will return an output (solution).
A reasonable run-time. Polynomial time.
Exponential time is not efficient.
As the problem grows, does the run-time grow as well. If yes, it is not efficient and not polynomial.
Algorithm is to solve a problem.
Categorise the problems.
P (polynomial)
NP (Non-Deterministic Polynomial)
Guessing
NP Hard Problem
Example: Say we have many cities. What is the shortest path which travels to all the cities exactly one time, AND returns to the starting point.
Input
Computer
Output
Computer could be on any operating system.
Unix
Windows
Could be done with any programming language.
Python
C++
Java
Syntax
You need to know how to write the structure of the programming language. i.e. How do I write this algorithm in python syntax?
Semantics
Semantics is the meaning.