A new utility product in the works is named LZ24 or "Liz24" for LZ 2024. It is a perfect data compressor. Dictionaries of up to 2^29 bytes (512 MB) can be chained on order of 2^25 such to handle total file size input and output of 3.6e+16 bytes. Anticipated pricing is $997 plus 15% maintenance. LZ24 is ideal for compressing huge sets of scientific data as in weather models, nearly random data, and operating system images on networks.
The Meth8/VŁ4 modal logic model checker is shipping. A student demo download program for (p,q) is now at $47. Products for sale are scaled by the number of propositional variables allowed as 3, 4, and 11: $497 for (p,q,r); $9,997 for (p,q,r,s) and (A,B,C,D); and $19,997 for (p-z). Standard trade discounts apply to qualified resellers. This manifest has scalability for up to 22-propositional variables in external look up tables on a 4.7 GB CD with pricing on request.
For analytical theology, metaphysical conjectures can be mapped as physicalistic scripts in updates.
* To build more industrial grade code of Meth8/VŁ4, 28 string utilities in TrueBASIC are implemented in Ada 95 with certified test harness and exempt from ITAR. String functions are each priced as $497 with suite of 28 as $12,997. One-time maintenance is 15%. M8VL4 is $9,997 (4-variables) and $19,997 (11-variables) per CPU core, and an SBC.
Recent advances in disruptive technology are: [Papers below after 9/7/2023 are in the results fascicle file.]- Inadvertent discovery of modal logic by George Boole over 100-years before attribution to another
- Celebrating the Sesquicentennial of Cantor's Theorem (Cantor's enormity, 150-years later), video
- Falsification of Georg Cantor's diagonal argument in most compact form using fractions of 1, 2, and 3
- Denial of inference rules abduction and induction by bag of beans of C.S. Peirce, to confirm only deduction
- Denial of the universe of Grothendieck via one axiom and one theorem
- Refutation of analogical and causal reasoning to invalidate the artificial intelligence (AI) engine iAsk.ai
- Refutation of the generalization rule as: If variable x does not occur free in p, then from p→s, infer p→∀xs
- Refutation of the principle / rule of implied quantification / instantiation where F(x,y) = ∀x∀y(F(x,y))
- Refutation of computational tree logic (CTL) and formulas to express system specifications [used by AI]
- Refutation of time as a dimension, confirming 2D-complex Clifford tori for unit spheres
- Retutation of information flow network (IFF) and category theory
- Physics cannot confirm topology's fixed-point theorem, and mathematical proof assumes refuted set theory
- Refutation of Gödel Program with ZFC and Hilbert’s first continuum problem without ZFC
Other products, papers, and free software source code are at the cec-services.com subsite. For example, this handy N-by-M contingency test with Fisher P in TrueBASIC source code derives expected values from the observed values.
Accessibility 508 immunity statement: This site is freely accessible, but no longer open to the public. wai-aa wcag-2.1