# Occam’s Razor as a Formal Basis for a Physical Theory

@article{Soklakov2000OccamsRA, title={Occam’s Razor as a Formal Basis for a Physical Theory}, author={Andrei N. Soklakov}, journal={Foundations of Physics Letters}, year={2000}, volume={15}, pages={107-135} }

We introduce the principle of Occam’s Razor in a form that can be used as a basis for economical formulations of physics. This allows us to explain the general structure of the Lagrangian for a composite physical system, as well as some other artificial postulates behind the variational formulations of physical laws. As an example, we derive Hamilton’s principle of stationary action together with the Lagrangians for the cases of Newtonian mechanics, relativistic mechanics and a relativistic…

## 36 Citations

Rethinking the Formal Methodology (II): Cognitive Content of Relativity (On the Centenary of General Relativity)

- Philosophy, Physics
- 2015

An attempt to epistemological completion of formal-math theories of relativity is presented. Causal interpretations of SR and GR are suggested. The problem to physical gist of gravity is explained as…

Computational Solution to Quantum Foundational Problems

- Physics, Computer Science
- 2014

This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main…

Rethinking the Formal Methodology (II): Exploring Cognitive Side of Gravity

- 2015

An attempt to epistemological completion of formal-math theories of relativity is presented. Causal interpretations of SR and GR are suggested. The problem to physical gist of gravity is explained as…

Diagrammatic analysis of the unitary group for double-barrier ballistic cavities: Equivalence with circuit theory

- Physics
- 2005

We derive a set of coupled nonlinear algebraic equations for the asymptotics of the Poisson kernel distribution describing the statistical properties of a two-terminal double-barrier chaotic billiard…

Entropy is complexity

- Physics, Mathematics
- 2004

In a recent paper Andrei N. Soklakov explained the foundations of the Lagrangian formulation of classical particle mechanics by means of Kolmogorov complexity. In the present paper we use some of…

The G\"{o}del Universe and the Einstein-Podolsky-Rosen Paradox

- Physics
- 2016

Notion of causality in G\"{o}del universe, is compared with what is implied by the Einstein-Podolski-Rosen (EPR) type experiments of quantum mechanics. Red shift of light from distant galaxies is…

Holographic fluctuations and the principle of minimal complexity

- Physics
- 2016

A bstractWe discuss, from a quantum information perspective, recent proposals of Maldacena, Ryu, Takayanagi, van Raamsdonk, Swingle, and Susskind that spacetime is an emergent property of the quantum…

A Scientific Metaphysics and Ockham’s Razor

- PhilosophyAxiomathes
- 2019

I argue that although Ockham’s Razor (OR) has its origins in a-priorist ontological mandates according to the purposes of natural theology and natural philosophy as influenced by it, the principle…

Grand challenges in interdisciplinary physics

- PhysicsFront. Phys.
- 2014

The dictionary definition of physics is the study of matter, energy, and the interaction between them1. There is no doubt that this definition does describe the core of physics. However, over the…

Black Holes Have No Interior Singularities

- Physics
- 2014

The paper describes a simple solution based on a relativistic extension of Newton-Galileo physics to the purely gravitational, spherical supermassive black hole. The solution yields a black hole size…

## References

SHOWING 1-10 OF 33 REFERENCES

Quantum field theory

- Physics
- 1956

This book is a modern pedagogic introduction to the ideas and techniques of quantum field theory. After a brief overview of particle physics and a survey of relativistic wave equations and Lagrangian…

Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity

- Physics, Mathematics
- 1995

Quantum gravity has great difficulties in the application of the notion of probability. We analyse this problem according to the algorithmic viewpoint. According to Kolmogorov, the probability notion…

FIELD THEORY. A MODERN PRIMER

- Biology, Physics
- 1981

This chapter discusses the Feynman Path Integral in Field Theory and path Integral Formulation of Guage Theories, as well as investigating the role of Yang-Mills and Gravity in the construction of the FPR.

The Theory Of Fundamental Processes

- Physics
- 1961

Review of the principles of quantum mechanics spin and statistics rotations and angular momentum rules of composition of angular momentum relativity electromagnetic and fermi couplings fermi…

Classical Mechanics 2nd edn

- Philosophy
- 1974

T W B Kibble Maidenhead: McGraw-Hill 1973 pp xii + 254 price £4.25 (cased) £3.15 (paperback) As Professor Kibble states in the preface, the subject of classical mechanics lacks the glamorous aura of…

The classical theory of fields

- Physics
- 1952

The principle of relativity Relativistic mechanics Electromagnetic fields Electromagnetic waves The propagation of light The field of moving charges Radiation of electromagnetic waves Particle in a…

A Formal Theory of Inductive Inference. Part II

- Computer Science, MathematicsInf. Control.
- 1964

1. Summary In Part I, four ostensibly different theoretical models of induction are presented, in which the problem dealt with is the extrapolation of a very long sequence of symbols—presumably…

A PRELIMINARY REPORT ON A GENERAL THEORY OF INDUCTIVE INFERENCE

- Mathematics
- 2001

Some preliminary work is presented on a very general new theory of inductive inference. The extrapolation of an ordered sequence of symbols is implemented by computing the a priori probabilities of…

Path Integrals and the Indefiniteness of the Gravitational Action

- Physics
- 1978

The Euclidean action for gravity is not positive definite unlike those of scalar and Yang-Mills fields. Indefiniteness arises because conformal transformations can make the action arbitrarily…

Complexity analysis for algorithmically simple strings

- Computer ScienceArXiv
- 2000

It is argued that Kolmogorov complexity calculus can be more useful if it is refined to include an important practical case of simple binary strings, and shows that under such restrictions some error terms can disappear from the standard complexity calculus.