Exploring Rulial Space: The Case of Turing Machines
Discrete Mathematics
2021-01-27 v1 Computational Complexity
Logic in Computer Science
Abstract
As an example of the concept of rulial space, we explore the case of simple Turing machines. We construct the rulial multiway graph which represents the behavior of all possible Turing machines with a certain class of rules. This graph (which is a Cayley graph of a "Turing machine group") gives a map of the space of non-deterministic Turing machines. We investigate the subgraph formed by deterministic machines, and explore the relationship to the P vs. NP problem. We also consider the implications of features of rulial space for physics, including estimating the maximum speed \r{ho} in rulial space, relations between rulial black holes and computational reducibility, and interpretations of hypercomputation.
Keywords
Cite
@article{arxiv.2101.10907,
title = {Exploring Rulial Space: The Case of Turing Machines},
author = {Stephen Wolfram},
journal= {arXiv preprint arXiv:2101.10907},
year = {2021}
}