The computational complidad is an area of computer science
who studies the use of resources to solve a problem during the calculation of the respective algorithms .

The 2 resources are mainly analyzed: Publish Post

1. Time
2. Space (memoria9

At present computers to solve most problems are complex polynomial (See Computer Science – Complexity)
The problems are not resolved with our computers Current (can not be resolved in a timely fashion), has a complex type or Exponential Factor

• J2EE solutions do not depend on other products or programming interfaces for any manufacturer .
• architecture for deploying enterprise applications using Java and Internet technologies
• Model application development based on components .
• Distributed applications on multiple layers: the logic of the application is divided into components that are installed on different computers according to the layer to which they belong .

The field of the theory of computation in computer science involves subareas of

1. Theory of computing
2. automata theory : studying machines mathematically abstract and problems they are capable of resolving
3. Theory of the computer : studying the problems of decision that can be solved with an algorithm or equivalently with a Turing machine.
4. Theory of computational complexity: Theoretical study resources required for the calculation to solve a problem (time and space )

The field of Mathematical Foundations of Computer Science involves cryptography, graph theory, logic and theory of types

1. Cryptography: Algorithms protection of private data encryption of information < >

Graph Theory: Structures of data storage and busqeda algorithms (such as the traveling salesman problem, or the best route are in the classic theme )

Logica math:

3. It is divided into four subfields: theory of models , Theory of the demonstration, set theory and the theory of recursion.
4. Theory of types: Study and analysis on the data types yu application in the properties of the programs and their security

Fields of study computer science

• Mathematical Foundations
• Theory of computing
• algorithms and data structures
• Programming Languages and compilers
• Bases Data
• Systems concurrent, parallel and distributed
• Artificial Intelligence
• Computer Graphics
• Computer science

Achievements of the Computer Science:
fundamental contributions to science and society .

• formal definition of computer and computer
• Demonstrating that there are problems for which there is no solution and computational problems intractable.
• Concept of programming language, a tool for the precise expression of methodological information with different levels of abstraction
• revolutionary technologies: general-purpose computers, Internet, digital signatures, electronic commerce and search engines
• New forms of scientific research: Computational Physics Computational Chemistry