Computer Science – Computational Complexity
Scientific paper
2005-07-05
Progress in Physics, 2006, v. 3, 35-42
Computer Science
Computational Complexity
10 pages, made a minor correction
Scientific paper
In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school mathematics (with some calculus) and an elementary understanding of computer programming will be able to follow this article. First, we shall explain the significance of the P versus NP problem and solve it. Next, we shall describe two other famous mathematics problems, the Collatz 3n+1 Conjecture and the Riemann Hypothesis, and show how both Chaitin's incompleteness theorem and Wolfram's notion of "computational irreducibility" are important for understanding why no one has, as of yet, solved these two problems.
No associations
LandOfFree
Complexity Science for Simpletons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Complexity Science for Simpletons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity Science for Simpletons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-59179