# Ticket #4676 (new)

Opened 3 months ago

## You've got to check this out...(2 days left)

Reported by: | "Microsoft Flight Simulator" <MicrosoftFlightSimulator@…> | Owned by: | |
---|---|---|---|

Priority: | normal | Milestone: | 2.11 |

Component: | none | Version: | 3.8.0 |

Severity: | medium | Keywords: | |

Cc: | Language: | ||

Patch status: | Platform: |

### Description

You've got to check this out...(2 days left) http://fitwatchz.us/puXNXj4h9Ygf-F1OVi0WhSOjn4u_LMIqGDeKtHiKE-HIg3oZZA http://fitwatchz.us/F7OH14b59esNDGJ0ZcwrE07PsQYJGZKzS_JBKkwBM-wZUJqPCg hinery (ACM), and the IEEE Computer Society (IEEE CS)âidentifies four areas that it considers crucial to the discipline of computer science: theory of computation, algorithms and data structures, programming methodology and languages, and computer elements and architecture. In addition to these four areas, CSAB also identifies fields such as software engineering, artificial intelligence, computer networking and communication, database systems, parallel computation, distributed computation, humanâcomputer interaction, computer graphics, operating systems, and numerical and symbolic computation as being important areas of computer science. Theoretical computer science Main article: Theoretical computer science Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from the practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. Theory of computation Main article: Theory of computation According to Peter Denning, the fundamental question underlying computer science is, "What can be automated?" Theory of computation is focused on answering fundamental questions about what can be computed and what amount of resources are required to perform those computations. In an effort to answer the first question, computability theory examines which computational problems are solvable on various theoretical models of computation. The second question is addressed by computational complexity theory, which studies the time and space costs associated with different approaches to solving a multitude of computational problems. The famous P = NP? problem, one of the Millennium Prize Problems, is an open problem in the theory of computa

## Attachments

## Change History

**Note:**See TracTickets for help on using tickets.