DeepAI AI Chat
Log In Sign Up

Geometry of Program Synthesis

by   James Clift, et al.

We re-evaluate universal computation based on the synthesis of Turing machines. This leads to a view of programs as singularities of analytic varieties or, equivalently, as phases of the Bayesian posterior of a synthesis problem. This new point of view reveals unexplored directions of research in program synthesis, of which neural networks are a subset, for example in relation to phase transitions, complexity and generalisation. We also lay the empirical foundations for these new directions by reporting on our implementation in code of some simple experiments.


page 1

page 2

page 3

page 4


Theoretical Robopsychology: Samu Has Learned Turing Machines

From the point of view of a programmer, the robopsychology is a synonym ...

Programming-By-Example by Programming-By-Example: Synthesis of Looping Programs

Program synthesis has seen many new applications in recent years, in lar...

Bounded Synthesis of Reactive Programs

Most algorithms for the synthesis of reactive systems focus on the const...

Augmenting Type Signatures for Program Synthesis

Effective program synthesis requires a way to minimise the number of can...

Write, Execute, Assess: Program Synthesis with a REPL

We present a neural program synthesis approach integrating components wh...

Program synthesis performance constrained by non-linear spatial relations in Synthetic Visual Reasoning Test

Despite remarkable advances in automated visual recognition by machines,...

Computational Register Analysis and Synthesis

The study of register in computational language research has historicall...