Statistical Parsing

So I just discovered statistical parsing. It looks a lot like continuous hierarchy.
You would assign a probability to each ordering of a set. You would assign a probability to each membership of a set, and you would assign a probability or uncertainty to the value of any element.

Subjective Uncertainty in Code

So how do we apply subjectivity and uncertainty to code? Here's how: You are uncertain which method you are going to call. You are uncertain as to the order of the parameters to the method. Inside the method, you are uncertain as to which statements are in the body of the code. And you are uncertain as to the ordering of the statements. You are also uncertain of the number of objects and ordering that will be returned from a function.

If you were programming in Lisp, you wouldn't be sure of the ordering or content of the s-expressions in your program.

Turing Machines and Fuzzy Systems

So Turing Machines are based on symbols. But what if no two symbols are exactly alike, especially in time? Does it matter? Can a Turing machine recognize a symbol which is not exactly like what it's expecting? This is the whole problem with classical Turing machines, that they are based on symbols which are exact. (perhaps not quantum Turing machines)

Oscillating or Fuzzy or Uncertain Time

So if we are unsure of things in space, perhaps we can have uncertainty in time as well. Perhaps I can say it's 9pm + or - 7 minutes. Since we have time zones, we don't really know what the real exact time is, we are generally within one hour of the actual time. That provides a lot of leeway.

More on Continuous Hierarchy and Geometry

1. We are uncertain of what the fundamental aspect of geometry is (points don't exist)
2. We are uncertain of the collections of the fundamental aspects.

Continuous Hierarchy and Geometry

Here's how Continuous Hierarchy relates to geometry.

1. We are uncertain of either the velocity or the position of a point
2. We are uncertain of the ordering of points within a group.
3. We are uncertain of the points a group contains
4. A polygon is an uncertainly ordered group.

Reversible Computing

At the lowest level, reversible (quantum) computing (circuitry) can be done by maintaining the inputs from each computation. Thus there along with 2 inputs for an AND gate, there is an unknown input. There are 3 outputs as well, the 2 inputs, and the result from anding the two inputs. This allows computations to be reversed and checked as well. There is no loss of information, and unknowns progress into knowns. The only thing that you can't recover is the unknowns.