Combining Determinism and Indeterminism

09/02/2020
by   Michael Stephen Fiske, et al.
0

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(ℕ)) on the natural numbers ℕ. 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(ℕ) 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2021

Quantum smooth uncertainty principles for von Neumann bi-algebras

In this article, we prove various smooth uncertainty principles on von N...
research
01/27/2020

How symmetric is too symmetric for large quantum speedups?

Suppose a Boolean function f is symmetric under a group action G acting ...
research
06/06/2018

The stabilizer for n-qubit symmetric states

The stabilizer group for an n-qubit state |ϕ〉 is the set of all invertib...
research
03/06/2022

Frames for Graph Signals on the Symmetric Group: A Representation Theoretic Approach

An important problem in the field of graph signal processing is developi...
research
12/11/2017

Infinite and Bi-infinite Words with Decidable Monadic Theories

We study word structures of the form (D,<,P) where D is either N or Z, <...
research
11/12/2021

An Enhanced Adaptive Bi-clustering Algorithm through Building a Shielding Complex Sub-Matrix

Bi-clustering refers to the task of finding sub-matrices (indexed by a g...
research
11/21/2019

Trotter Kato Theorem for Bi Continuous Semigroups and Approximation of PDEs

In this paper, we introduce formulations of the Trotter Kato theorem for...

Please sign up or login with your details

Forgot password? Click here to reset