Proof isn't always possible

 The notorious reputation of NP Completeness promises to resolve decidabilities for specific cases.  With the word/expression “NP IN-complete,” as a clue, we can ask if it is worth considering a connection to the more famous incompleteness observation, Goedel’s Incompleteness Theorem. My preferred enumeration is “No finite set can contain all its own axioms.” To mitigate potential ridicule and cover my anatomy, this is a student type research blog, not a publication.

When Brin and Page brought us “directed search,” I fought for “agnostic search,” as a vocabulary term and a choice. I found Google to be receptive and responsive as a corporation, and Chloe Condon brought us the concept of agnostic layer. I wholeheartedly believe that agnostic layer will improve directed search. With any luck, it can also introduce opposing views alongside agreeing views that are more specialized, or enthusiastic. This article is for attribution, and to thank Chloe Condon for agnostic layer. I’m holding out for DuckDuckGo, Dogpile, and agnostic search as a choice.

An NFT is a way to distribute a single redistributable digital image as a logo.  To implement a pinup or a calendar, it is possible to distribute a tarball of encrypted zips. A zip file can contain any multimedia data package. The procedure would be to release one password a month upon receipt of cash. The obvious defeat is for bootleggers to organize to distribute the password once it is released. For this reason, this solution is useful only for limited runs. However, if the payoff for redistributing the password is limited, then bootleggers will not be motivated to do it.

A black box and a function might have very little difference between them. What might make the term “black box” definitive? As formative thinking, a black box is characterized by accomplishing its operation without affecting ANYTHING outside its internal mechanisms; perhaps this includes the idea that it cannot be observed. A “function,” is defined as “a reusable block of code that a specific task. It accepts input, processes it and “returns” a result.” My first thought on this, is that functions can return intermediate values, and black boxes might be barred from iteration or recursion by definition.

I was privileged to show Newton’s Method in integer arithmetic. Newton wanted to use fractions to see more decimal places, and the duration between his efforts and my good fortune, attests to the difficulty of maintaining objectivity or gaining new perspective. Here I must document that my breakthrough hasn’t solved the problem completely! (Quelle surprise!) The method I develop requires raising very large numbers to appreciably large powers. The actual integers become impractical very quickly. Note: It is fairly practical to get up to six (6) iterations for small n on numerals 1-9, with Python 3. Use this to estimate efficiency- how many decimals are becoming significant? I stipulate further that it is impractical to guarantee an exact margin of error, using my solution. Having supplied an answer to some algebra problem requiring Newton’s Method for its solution, I want to close by suggesting this: If we still want to see more decimal places, is there material advantage to be fo...

The predictively decreasing count of prime occurrences in 2^32 bands of the following thresholds introduces a question. “Can they serve as the basis for a mathematical model defining an FFT?” Totals Intermediate Boundary Sub-Totals We  could then take an interest in the viability of extrapolating predictively, and  the accuracy of the associated FFT, when evaluated in the context of more or less initial data. We can develop specific calculations to check results with unexpected certainty. We can run security researcher Bruce Schneier’s definitive “isPrime,” introducing a table of all primes < sqrt(range max value) taken from a table of primes < 2^32, for input data. As a practical matter, 80,000 entries will do to check an arbitrary start point for a range with a surprisingly large integer max-value.