Web Comm, 2018-19 edition

Minutes for lecture IV

----- Plan for the day -----

- Computability
	-The halting problem
	-The turing Machine
	
-Finite State Machine
	-a minimal example

-Complexity
	- O notation
	
-Feasibility
	- time trends: polinomial vs exponential time programs
	- P <> NP
	- Crack a HTTPS key is NP (luckily!!!)
	
Feasibility on the web
	-the client server architecture for the web
	-constrains on the both sides