Multicomputation with Numbers: The Case of Simple Multiway Systems

11/09/2021
by   Stephen Wolfram, et al.
0

Integer iteration rules such as n |-> a n + b, c n +d are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example, emergent geometry and difficult questions of confluence. Generalizations to rules involving non-integers and other functions are also considered. Connections with physics and with various number-theoretic and other questions are made.

READ FULL TEXT

page 21

page 23

page 25

page 26

page 32

page 41

page 42

research
02/17/2020

Convergent non complete interpolatory quadrature rules

We find a family of convergent schemes of nodes for non-complete interpo...
research
03/08/2021

Multiway Turing Machines

Multiway Turing machines (also known as nondeterministic Turing machines...
research
06/14/2019

Four beautiful quadrature rules

A framework is presented to compute approximations of an integral I(f)=∫...
research
12/05/2019

Easy-to-Hard: Leveraging Simple Questions for Complex Question Generation

This paper makes one of the first efforts toward automatically generatin...
research
04/15/2020

A Class of Models with the Potential to Represent Fundamental Physics

A class of models intended to be as minimal and structureless as possibl...
research
04/18/2020

Syn-QG: Syntactic and Shallow Semantic Rules for Question Generation

Question Generation (QG) is fundamentally a simple syntactic transformat...

Please sign up or login with your details

Forgot password? Click here to reset