On the “Heap” problem
Tóm tắt
In connection with the relationship of the heap paradox with quantum mechanics pointed out by V. P. Maslov, the feasibility and complexity of algorithms for counting very large sets in small time intervals is studied.
Tài liệu tham khảo
V. P. Maslov, “Mathematical Aspects of the Heap Paradox and the Hidden Parameter,” Math. Notes 103 (4), 678–681 (2018).
V. P. Maslov, “Passing from Mesoscopy to Macroscopy. The Mesoscopic Parameter k,” Russ. J. Math. Phys. 25 (1), 58–65 (2018).
Yu. L. Ershov, Numbering Theory [in Russian] (Nauka, Moscow, 1977), pp. 416).
Yu. L. Ershov, Problems of Decidability and Constructive Models (Nauka, Moscow, 1980), pp. 415. [in Russian].
S. S. Goncharov and Yu. L. Ershov, Constructive Models (Consultant Bureau, New York, 2000), pp. 293.
V. G. Puzarenko, “Countably Categorical Theories,” Algebra Logic 51 (3), 241–258 (2012).
G. Lorin, Sorting and Sorting Systems (Nauka, Moscow, 1983), pp. 384 [in Russian].