Related papers: Complexity Science for Simpletons
We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the…
In this essay, I attempt to provide supporting evidence as well as some balance for the thesis on `Transforming socio-economics with a new epistemology' presented by Hollingworth and Mueller (2008). First, I review a personal highlight of…
Complex numbers enter fundamental physics in at least two rather distinct ways. They are needed in quantum theories to make linear differential operators into Hermitian observables. Complex structures appear also, through Hodge duality, in…
In this chapter, I review the main methods and techniques of complex systems science. As a first step, I distinguish among the broad patterns which recur across complex systems, the topics complex systems science commonly studies, the tools…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
In this paper, we discuss two well-known open problems in the regularity theory for nonlinear, conformally invariant elliptic systems in dimensions $n\ge 3$, with a critical nonlinearity: $H$-systems (equations of hypersurfaces of…
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematical analysis. As a step toward mathematical analysis, we allow…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
The vast majority of scientific community believes that P!=NP, with countless supporting arguments. The number of people who believe otherwise probably amounts to as few as those opposing the 2nd Law of Thermodynamics. But isn't nature…
A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…
The Riemann hypothesis (RH) is a long-standing open problem in mathematics. It conjectures that non-trivial zeros of the zeta function all have real part equal to 1/2. The extent of the consequences of RH is far-reaching and touches a wide…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
Shallit and Wang showed that the automatic complexity $A(x)$ satisfies $A(x)\ge n/13$ for almost all $x\in{\{\mathtt{0},\mathtt{1}\}}^n$. They also stated that Holger Petersen had informed them that the constant 13 can be reduced to 7. Here…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
Quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the logical peculiarities of quantum observables. It generalizes, and on 1-dimensional Hilbert space coincides with, Boolean…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
Science is a crowning glory of the human spirit and its applications remain our best hope for social progress. But there are limitations to current science and perhaps to any science. The general mind-body problem is known to be intractable…
We examine the role of consistency with causality and quantum mechanics in determining the properties of gravitation. We begin by examining two different classes of interacting theories of massless spin 2 particles -- gravitons. One…