| viXra.org > Data Structures and Algorithms > 2212 |
 |
 |
| viXra.org > Data Structures and Algorithms > 2212 |
|
|
[5] viXra:2212.0219 [pdf] submitted on 2022-12-30 08:49:45
Authors: Evgeny Kuznetsov
Comments: 10 Pages. unicode symbol ≠ could be changed to != if needed
Things become different at infinity. A school example - if you count the number of even numbers up to 100, there are half as many of them as all numbers. And at infinity, every natural number corresponds to an even number. And it turns out that there is an equal quantity of each of them. Without limiting the quantity of numbers, it is impossible to mathematically prove that there ar fewer even numbers than all numbers. A similar story is observed in complexity theory. In this paper, using a lazy Turing machine, it is proved that for programs with infinite length, the maximum complexity is O(n). And one of the consequences of this fact is that P = NP at infinity. And because of this, as one of the consequences of the last statement, it is impossible to prove that P ≠ NP without limiting the program’s length. In time hierarchy theorem, diagonalization implicitly limits the program’s length. We need a similar trick to keep progress going.
Category: Data Structures and Algorithms
[4] viXra:2212.0184 [pdf] submitted on 2022-12-26 01:27:36
Authors: Alexey Podorov
Comments: 7 Pages. The structure, grammar and examples of a programming language for teaching are offered
The structure, grammar and examples of a programming language for teaching are offered.
Category: Data Structures and Algorithms
[3] viXra:2212.0144 [pdf] submitted on 2022-12-19 02:17:28
Authors: Gilbert Krougman, Pasoul Rozhier, Kawabata Yakurami
Comments: 6 Pages.
Consider non-cooperative pen games where both players act strategically and heavily influence each other. In spam and malware detection, players exploit randomization to obfuscate malicious data and increase their chances of evading detection at test time. The result shows Pen-PL Games have a probability distribution that approximates a Gaussian distribution according to some probability distribution defined over the respective strategy set. With quadratic cost functions and multivariate Gaussian processes, evolving according to first order auto-regressive models, we show that Pen-PL "smooth" curve signaling rules are optimal. Finally, we show that computing a socially optimal Pen-PL network placement is NP-hard and that this result holds for all P-PL-G distributions.
Category: Data Structures and Algorithms
[2] viXra:2212.0071 [pdf] replaced on 2023-05-10 05:55:08
Authors: Herman Schoeneld
Comments: 18 Pages.
A quantum-resistant, many-time signature scheme combining Winternitz and Merkle-Signature schemes is proposed. This construction is compatible with the Abstract Merkle Signature (AMS) Scheme and thus is an AMS-algorithm called "WAMS"
Category: Data Structures and Algorithms
[1] viXra:2212.0019 [pdf] replaced on 2023-05-10 05:59:01
Authors: Herman Schoenfeld
Comments: 17 Pages.
An abstract post-quantum digital signature scheme is presented that parameterizes a one-time signature scheme (OTS) for "many-time" use. This scheme permits a single key-pair to efficiently sign and verify a (great) many messages without security degradation. It achieves this by following the original Merkle-Signature Scheme but without a coupling to a specific OTS. Various improvements include a reduction in signature size, resistance to denial-of-service attacks and smaller keys. This construction comprises a bit-level specification for the Abstract Merkle Signature Scheme (AMS).
Category: Data Structures and Algorithms
| Third-Party Links: |
|