JSJohn Skilling

John Skilling

*This is an algorithmically generated author record based on publicly available information.

John Skilling has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Nested Sampling—The Idea

    by John Skilling

    We seek to add up Q=∫fdX over unit volume in arbitrary dimension. Nested sampling locates the bulk of Q by geometrical compression, using a Monte Carlo ensemble constrained within a progressively more restrictive lower limit f≤f*. This domain is divided into a core f>f* and a shell f=f*, with the core kept adequately populated.


  • Open Access

    On Foundational Physics

    by John Skilling, Kevin H. Knuth

    As physicists, we wish to make mental models of the world around us. For this to be useful, we need to be able to classify features of the world into symbols and develop a rational calculus for their manipulation. In seeking maximal generality, we aim for minimal restrictive assumptions. That inquiry starts by developing basic arithmetic and proceeds to develop the formalism of quantum theory and relativity.

  • Open Access

    The ABC of Physics

    by John Skilling, Kevin Knuth

    Why quantum? Why spacetime? We find that the key idea underlying both is uncertainty. In a world lacking probes of unlimited delicacy, our knowledge of quantities is necessarily accompanied by uncertainty. Consequently, physics requires a calculus of number pairs and not only scalars for quantity alone. Basic symmetries of shuffling and sequencing dictate that pairs obey ordinary component-wise addition, but they can have three different multiplication rules. We call those rules A, B and C. “A” shows that pairs behave as complex numbers, which is why quantum theory is complex. However, consistency with the ordinary scalar rules of probability shows that the fundamental object is not a particle on its Hilbert sphere but a stream represented by a Gaussian distribution. “B” is then applied to pairs of complex numbers (qubits) and produces the Pauli matrices for which its operation defines the space of four vectors. “C” then allows integration of what can then be recognised as energy-momentum into time and space. The picture is entirely consistent. Spacetime is a construct of quantum and not a container for it.

  • Open Access

    The Arithmetic of Uncertainty unifies Quantum Formalism and Relativistic Spacetime

    by John Skilling, Kevin Knuth

    The theories of quantum mechanics and relativity dramatically altered our understanding of the universe ushering in the era of modern physics. Quantum theory deals with objects probabilistically at small scales, whereas relativity deals classically with motion in space and time. We show here that the mathematical structures of quantum theory and of relativity follow together from pure thought, defined and uniquely constrained by the same elementary ``combining and sequencing'' symmetries that underlie standard arithmetic and probability. The key is uncertainty, which inevitably accompanies observation of quantity and imposes the use of pairs of numbers. The symmetries then lead directly to the use of complex \sqrt{-1} arithmetic, the standard calculus of quantum mechanics, and the Lorentz transformations of relativistic spacetime. One dimension of time and three dimensions of space are thus derived as the profound and inevitable framework of physics.


  • Open Access

    Information Geometry Conflicts With Independence

    by John Skilling

    Information Geometry conflicts with the independence that is required for science and for rational inference generally.

  • Open Access

    Galilean and Hamiltonian Monte Carlo

    by John Skilling

    Galilean Monte Carlo (GMC) allows exploration in a big space along systematic trajectories, thus evading the square-root inefficiency of independent steps. Galilean Monte Carlo has greater generality and power than its historical precursor Hamiltonian Monte Carlo because it discards second-order propagation under forces in favour of elementary force-free motion. Nested sampling (for which GMC was originally designed) has similar dominance over simulated annealing, which loses power by imposing an unnecessary thermal blurring over energy.


  • Open Access

    The Physics of Information

    by Torsten A. Enßlin, Jens Jasche, John Skilling


  • David MacKay’s wooden blocks

    by John Skilling

    This paper is dedicated to the memory of Professor Sir David MacKay FRS. In his inspiring last talk, MacKay discussed the problem of packing his young son’s identical wooden blocks, of size 2×1×1. How many ways are there of packing n3/2 such blocks into a cubical box of volume n3? This is the same problem as finding the entropy of cubic packing of dimeric molecules, so the investigation is not merely childish. Here, I use this example as an exemplar of the use of nested sampling in computational inference. In this analogy, the posterior covers the “glassy” arrangements of non-overlapping blocks in the box, whereas the prior represents the wider set of unrestricted model configurations. The required number of possible glass states is the compressive prior-to-posterior fraction of the known number of model configurations. And the compression (as logarithm) is immediately available from the number of equilibrating iterations in nested sampling. The clarity of this example offers useful lessons for computational inference more generally.

  • Open Access

    Foundations of Inference

    by Kevin H. Knuth, John Skilling

    We present a simple and clear foundation for finite inference that unites and significantly extends the approaches of Kolmogorov and Cox. Our approach is based on quantifying lattices of logical statements in a way that satisfies general lattice symmetries. With other applications such as measure theory in mind, our derivations assume minimal symmetries, relying on neither negation nor continuity nor differentiability. Each relevant symmetry corresponds to an axiom of quantification, and these axioms are used to derive a unique set of quantifying rules that form the familiar probability calculus. We also derive a unique quantification of divergence, entropy and information.


  • Open Access

    Foundations of Inference

    by Kevin H. Knuth, John Skilling

    We present a simple and clear foundation for finite inference that unites and significantly extends the approaches of Kolmogorov and Cox. Our approach is based on quantifying lattices of logical statements in a way that satisfies general lattice symmetries. With other applications such as measure theory in mind, our derivations assume minimal symmetries, relying on neither negation nor continuity nor differentiability. Each relevant symmetry corresponds to an axiom of quantification, and these axioms are used to derive a unique set of quantifying rules that form the familiar probability calculus. We also derive a unique quantification of divergence, entropy and information.