O(1) = Par o impar
O(Log n) = Busqueda Binaria
O(n) = Busqueda secuencial
O(n Log n) = QuickSort
O(n^2) = BubbleSort

ComputerSciencie:mathematical logic,automata theory,computability,computationalComplexity,criptography,
combinatorialOptimization.
PracticalComputerSciencie:ArtificalInteligence,ComputerArchitecture,
ComputerGraphics,databases,softwareEngineering,DistrubutedSystems,
ComputerSecuity,Human-computer Interaction. Elements of a Turing machine: possible states,initiate state,final state,current state,finite set of symbols,input symbols.ABSTRACT MACHINE: theorical model of system,used for analysis of computability and complexity of algorithms, Automata, statemachine.DTM: for al his states theres only 1 transsition.NDTM: one or more states,there is more than one transition.3 clases of complexity:FEASABLE,MAYBE NOT,NOT FEASIBLE. FEASABLE: L solved by DTM(LOG N),NL NDTM(LOG N), P solved DTM O(n^k). P-COMPLETE problems if exists another problem P complexity that  can be reduced into problem  x in a (log n)^c time bye using n^k processors at the same time..MAYBE NOT FEASIBLE: NP (NON DETERMINISTIC PPLYNOMIAL TIME) optimizacion, NP-COMPLETE maybe solved in a time that rapidly increses,(search space).NOT FEASIBLE EXPTIME=riquire a DTM using O(2^pn) the best move in a chess play,NEXPTIME problems rquieres NDTM using  time unlimited Space.

Tim Berners-Lee (1955)British.Word Wide Web.Development of the HTTP protocol/Vint Cerf(1943)American.Father of the Internet, together with Bob Kahn.Development of the TCP/IP protocol./ Bob Kahn(1938)American.Father of the Internet, together with Vint Cerf.Development of the TCP/IP protocol./ James Gosling(1955)Canadian.Design and implementation of Java./ Donald Norman(1935)American.Human Computer Interaction.User centered design.Usability./ Ted Nelson(1937)American.Concepts of Hipertext & Hypermedia./ Douglas Engelbart(1925 – 2013 American.Invented the mouse.Hipertext pioneer./ Bjarne Stroustrup(1950)Danish.Design and implementation of C++./James Rumbaugh(1947)American.Object oriented Modelling (OMT).UML : Unified Modeling Language./ Alan Kay(1940)American.Object oriented programming (Smalltalk)Graphic iser interfaces (GUI).Concepts of laptop & tablet./ Ken Thompson(1943)American.UNIX, together with Dennis Ritchie.UTF-8 code./ Dennis Ritchie(1941 – 2011)American.C language.UNIX, together with Ken Thompson./ Niklaus Wirth(1934)Swiss.Structured programming languajes (PL/0, PASCAL)./ Donald D. Chamberlin(1944 – 2003)American.SQL (Structured Query Language) together with Raymond Boyce/Edgar F. Codd(1923 – 2003)British.Data Bases (relational model)./ Donald Knuth(1938)American.Algorithm Analysis.The Art of Computing Programming.Data structures./ Edsger W. Dijkstra(1930 – 2002)Dutch.Structured programming.Recursion (ALGOL 60)/ John McCarthy(1927 – 2011).American.Artificial Intelligence.Functional programming (LISP).Trees (data structures)./ Seymour Cray(1925 – 1996).American.Design of Supercomputers.Parallel Computing./ Peter Naur(1928)Danish.Programming Language syntax descrtiption..First language with programming structures (ALGOL).Fundamentals of Software Engineering./ John Backus(1924 – 2007)AmericanFirst widely used programming language (FORTRAN)Formal Notation for defining programming languages./ Noam Chomsky1928)American.Formal Languages.Formar Grammars.Political activist./ Claude Shannon(1916 - 2001)American.Information Theory.Game Theory.Digital Circuits Design./ John Vincent Atanasoff(1903 - 1995)American.First electronic digital computer.ABC: Atanasoff-Berry-Computer./ Konrad Zuse(1910 - 1995)German.First electromechanic programmable computer./ John von Neumann(1903 – 1957 From Hungary.Digital Computer Architecture.Merge Sort. Norbert Wiener(1894 - 1964)American.Electronic control.Fundamental of Robotics.Cybernetics./