Algorithmic Scientific Inference: Within Our Computable Expected Reality?
It is argued that, scientific laws, including quantum mechanical ones, can be considered algorithmic, that the expected behavior of the world, if not its exact behavior, is algorithmic, that, then, communities of human scientists over time have algorithmic expected behavior.
Some sample theorems about the boundaries of algorithmic scientific inference are then presented and interpreted. There is some discussion about (but there are not presentations of) succinct machine self-reference proofs of these theorems and whether non-artifactual self-referential examples may exist in the world.
There is also a brief discussion regarding the possibility that the expected behavior of reality may be infeasibly computable.
Keywords: machine inductive inference, discrete physics, expectation values, philosophy of science, cellular automata, hypercomputation, machine self-reference, feasible computation