DeepAI AI Chat
Log In Sign Up

Complexity Science for Simpletons

by   Craig Alan Feinstein, et al.

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.


page 1

page 2

page 3

page 4


Conceptual Mathematics via Literate Programming

Recent developments in computer programming and in mathematics suggest t...

The Mathematics of László Lovász

This is an exposition of the contributions of László Lovász to mathemati...

A Stronger Foundation for Computer Science and P=NP

This article constructs a Turing Machine which can solve for β^' which i...

On proof theory in computer science

The subject logic in computer science should entail proof theoretic appl...

A review on mathematical strength and analysis of Enigma

In this review article, we discussed the Mathematics and mechanics behin...

Tensors in computations

The notion of a tensor captures three great ideas: equivariance, multili...

An Invitation to Polynomiography via Exponential Series

The subject of Polynomiography deals with algorithmic visualization of p...