scientific article; zbMATH DE number 2187721

zbMath1072.81005MaRDI QIDQ5460920

Andrey Finkelshteyn, Vladik Ya. Kreinovich

Publication date: 20 July 2005

Full work available at URL: https://eudml.org/doc/226303

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityKolmogorov complexityDirac's fundamental constants

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) General and philosophical questions in quantum theory (81P05) Philosophical and critical aspects of logic and foundations (03A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) General mathematical topics and methods in quantum theory (81Q99) Theory of computing (68Q99)

Related Items (2)

Towards Formalizing Non-monotonic Reasoning in Physics: Logical Approach Based on Physical Induction and Its Relation to Kolmogorov Complexity ⋮ When are two wave functions distinguishable: a new answer to Pauli's question, with potential application to quantum cosmology

This page was built for publication: