Home

Applications For Monomial Deciders

Welcome to the Applications for Monomial Deciders wiki!

This wiki is intended to elaborate and provide insight into the article, "Applications for Monomial Deciders".

Good analysis should do the following:

1. It should uncover new methods and techniques.
2. It should uncover new connections and applications for different fields of study - not just mathematics.
3. Lastly, it should give meaning and intuition to numbers, symbols, and equations.

1. Starting With a Theorem of Infiniteness

2. Mapping Out Worlds

3. Euler's Constant

4. Sketching Into Code

5. Gather Some Data

6. Representing Monomial Deciders As Code

7. Negative Numbers

8. Pi

9. Fibonacci

It is here that I can come back to the Fibonacci sequence and show why given a minimum length in the sequence, we can form a basis of inference.

10. Analysis Of Parity In Fibonacci

11. Redrawing the Fibonacci Sequence

A set of generator functions seen in algebraic geometry can be used to represent assembly and dynamic programming problems.

12. The Fibonacci Decider

Using what we know above, given a set of generators, we can apply it to decision problems as well. A set of decision functions are necessary to form a decider which shows that it verifies a problem.

13. The Fibonacci Picking Function

Notice that the left hand side of the equation has two positive nodes instead of two negative nodes. The fibonacci picking function will be analyzed even furthur in the article, Inferrable Languages.

I find that the harder I work, the more luck I seem to have. - Thomas Jefferson