English

Combining Determinism and Indeterminism

Logic 2020-11-20 v4 Computational Complexity Computation and Language Group Theory

Abstract

Our goal is to construct mathematical operations that combine indeterminism measured from quantum randomness with computational determinism so that non-mechanistic behavior is preserved in the computation. Formally, some results about operations applied to computably enumerable (c.e.) and bi-immune sets are proven here, where the objective is for the operations to preserve bi-immunity. While developing rearrangement operations on the natural numbers, we discovered that the bi-immune rearrangements generate an uncountable subgroup of the infinite symmetric group (Sym(N)(\mathbb{N})) on the natural numbers N\mathbb{N}. This new uncountable subgroup is called the bi-immune symmetric group. We show that the bi-immune symmetric group contains the finitary symmetric group on the natural numbers, and consequently is highly transitive. Furthermore, the bi-immune symmetric group is dense in Sym(N)(\mathbb{N}) with respect to the pointwise convergence topology. The complete structure of the bi-immune symmetric group and its subgroups generated by one or more bi-immune rearrangements is unknown.

Keywords

Cite

@article{arxiv.2009.03996,
  title  = {Combining Determinism and Indeterminism},
  author = {Michael Stephen Fiske},
  journal= {arXiv preprint arXiv:2009.03996},
  year   = {2020}
}

Comments

12 pages

R2 v1 2026-06-23T18:24:11.598Z