Summary of the roo-poohh-tigger studies: P=PSPACE, UNLIMITED LOSSLESS DATA COMPRESSION, THE RIEMANN HYPOTHESIS DEMYSTIFIED

1. SUMMARY OF THE ROO-POOH-
TIGGER STUDIES
(June, 2018)
(Now going into hibernation for some time)
HOBBYIST STUDIES
ENTERTAINMENT
(BEYOND GATE)
(The magic of the Riemann Hypothesis applied to the harmonious interaction of
competing and cooperating vanilla finite Harmonic Series using the mysterious
Euler-Mascheroni gamma constant which allows nondeterminism to be tractably
tackled by the traditional von Neumann computer)

2. These studies have yielded the strange results that P=AP=NP=PSPACE & that it is
possible to better in space requirements the Arabic positional representation of an
integer. These results may not be generally acceptable and the student should not use
them in formal/informal training/education programs. The student is advised to
follow the standard texts and accepted results.
THREE RESULTS
1. The Roo Number System.
An integer n represented in the Arabic Positional Number System is
bloated up to an enormous size using error control coding over
deterministic controlled channels where the Shannon Limit does not
apply. Then it is collapsed to a refereed NP-complete problem to a
succinct sizewhich is less thanlog(n). This works for all integers beyond
a certain basic size.
2. The Pooh-Tigger race.
All types of nondeterministic behaviour lend themselves to simple
explanations. Nondeterminism is merely practical deterministic
exhaustive search using Pooh-Tigger races which are based on the
Harmonic Series and the mysterious Euler-Mascheroni constant.
The search for an element in an exponential amount of data in
deterministic polynomial time is the key to the solution. In the case of
Existentialnondeterminism Tigger will be exactly half a house ahead of
Pooh when there is success. In the case of Universal nondeterminism
Tigger will never be exactly half a house ahead of Pooh. Both types of
exhaustivesearch take only a deterministic polynomial amount of time.
Thus it is possible to simulate in deterministic polynomial time an

3. alternating Turingmachinefor the TQBF problem by Pooh-Tigger races.
This allows the conclusion that P=AP=NP=PSPACE.
The Memex gives a rich number of methods that solve many problems
using alternating Turing machines in polynomial time. For example we
have context sensitive recognition and simulation of a NDTM in
PSPACE. With deterministic polynomial time Pooh-Tigger races the
alternating Turing machines can be simulated in deterministic
polynomial time.
3. The Riemann Hypothesis demystified.
The Riemann Hypothesis lends itself to a simple explanation with the
Pooh-Tigger races. A zero the Riemannzeta functionoccurswhen Tigger
is exactlyhalf a house ahead of Pooh in a cake distribution race!! A zero
corresponds exactly and uniquely to a pair consisting of a composite
integer and one of its factors.