On the enumeration of sentences by compactness

06/15/2017
by   Mark A. Stalzer, et al.
0

Presented is a Julia meta-program that discovers compact theories from data if they exist. It writes candidate theories in Julia and then validates: tossing the bad theories and keeping the good theories. Compactness is measured by a metric: such as the number of space-time derivatives. The underlying algorithm is applicable to a wide variety of combinatorics problems and compactness serves to cut down the search space.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2022

An Investigation of Kripke-style Modal Type Theories

This technical report investigates Kripke-style modal type theories, bot...
research
08/14/2017

TheoSea: Marching Theory to Light

There is sufficient information in the far-field of a radiating dipole a...
research
02/18/2019

The meta-problem and the transfer of knowledge between theories of consciousness: a software engineer's take

This contribution examines two radically different explanations of our p...
research
05/11/2023

Layered Modal Type Theories

We introduce layers to modal type theories, which subsequently enables t...
research
12/24/2021

Decompositions of Stratified Institutions

The theory of stratified institutions is a general axiomatic approach to...
research
11/07/2019

Perspectives on urban theories

At the end of the five years of work in our GeoDiverCity program, we bro...
research
07/08/2021

Degrees of riskiness, falsifiability, and truthlikeness. A neo-Popperian account applicable to probabilistic theories

In this paper, we take a fresh look at three Popperian concepts: riskine...

Please sign up or login with your details

Forgot password? Click here to reset