[4] viXra:2108.0121 [pdf] submitted on 2021-08-23 13:12:52
Authors: Mirzakhmet Syzdykov
Comments: 7 Pages.
This work describes the hypothesis of the relation between the classes of complexity: for this
purpose we define the functions over algorithms or state machines for which the equality holds true and,
thus, the decision can be made towards polynomial reduction of the computational complexity of algorithms.
The specific class of impractical or exponential measures of complexity against the polynomial ones is also
discussed – for this case we divide these classes according to the discrete numbers which are known to the
present time. We also present the approximate algorithm for the classical NP-complete problem like
Traveling Salesman using the memory construction. The question of P and NP equality is important in
decision-making algorithms which commonly decide inequality of these classes – we define the memory
factor which is exponential and space consumption is non-deterministic. The memory consumption problem
within the memorization principle or dynamic programming can be of varying nature giving us the decision
to build the approximation methods like it’s shown on the example of Traveling Salesman problem. We also
give the notion of the past work in theory of complexity which, in our opinion, is of the same consideration
in most cases when the functional part is omitted or even isn’t taken into account. The model theorem with
its proof of the equality of classes over congruent function is also given in the end of this article.
Category: General Mathematics
[3] viXra:2108.0118 [pdf] submitted on 2021-08-23 13:45:15
Authors: Edgar Valdebenito
Comments: 8 Pages.
In this note we give some formulas related with the Theodorus constant T=1.860025...
Category: General Mathematics
[2] viXra:2108.0084 [pdf] replaced on 2021-11-09 12:24:44
Authors: Juan Jorge Isaac Lopez
Comments: 4 Pages.
Identities of the coefficients of the polynomial equations are created in function of the parameters that define their roots, and with their application it is created a process to solve polynomial equations with rational coefficients.
Category: General Mathematics
[1] viXra:2108.0074 [pdf] submitted on 2021-08-15 20:05:27
Authors: John Hodge
Comments: 13 Pages.
Orthodox physics makes extensive use of number relation mathematics such as mapping, probability, and infinite series. This mathematics is devoid of causative relations. Other scientific disciplines such as medicine and chemistry use causative models. Using causative models would advance physics. Causation should be overtly stated in the mathematics. Causation is linked with emergence philosophy and not reductionism.
Category: General Mathematics