From Newsgroup: sci.math

Hi,

The Latin cogito, ergo sum, usually translated
into English as "I think, therefore I am",[a]
is the "first principle" of the philosophy of
the French scientist and philosopher Ren|- Descartes.

The new CogitoAI System features explanation
compression using the motto:

**********************************************
Search First, Explain Later
**********************************************

Its very easy to implement, and based on intuitionist
logic Curry Howard exists witness terms, a rule:

P(X, Y) :- Q(X, Z), R(Z, Y).

Is transformed into, combining existential and conjunction:

P(X, Y, rule(Z, S, T)) :- Q(X, Z, S), R(Z, Y, T).

So the search will only return the compressed form
you can later generate fancy trees, with fact
prevenance, rule references, coloring, bells and

whistles. Dunno, just an idea based on:

formalise existential quantification by
declaring a suitable record type https://plfa.github.io/Quantifiers/#existentials

LoL

Bye

Mild Shock schrieb:

Hi,

The diagram figure 2 here:

Fifty Years of Prolog and Beyond (TPLP 2022)
K|uRNER P, LEUSCHEL M, BARBOSA J, et al. Fifty Years of Prolog and
Beyond. Theory and Practice of Logic Programming.
2022;22(6):776-858. doi:10.1017/S1471068422000102

And reproduced here:

Comparison of Prolog implementations
The page has also missing Scryer Prolog, which
I think is an important Prolog system written in
Rust, because it also pays tribute to Prolog II. https://en.wikipedia.org/wiki/Comparison_of_Prolog_implementations

Is pretty much brainwashed nonsense. Most Prolog
systems, that have cyclic terms, are derived from
Prolog II.-a Adopting a non-canonical rational tree

term approach. This includes:

- SICStus Prolog
- Ciao Prolog
- YAP Prolog
- SWI-Prolog
- Scryer Prolog
- Trealla Prolog
- Dogelog Player
- What else?

SICStus Prolog is possibly the most advanced, (*)
it also supports asserts and copying, whereas I found
not all Prolog systems listed above can even

copy cyclic terms, despite they can unify them.
Basically the philogeny of Prolog systems is
not some "single inheritance" tree. Cyclic terms

algorithm have nice side effect that they might
speed up acyclic term arguments as well. But
cyclic terms is one of the topics that is very

badily-a covered, for some individuals difficult (**)
to understand and sometimes even completely ignored.

Bye

(*)
SICStus Prolog unifies, compares (see ref-lte-cte),
asserts, and copies cyclic terms without looping.
The write_term/[2,3] built-in predicate can
optionally handle cyclic terms. https://sicstus.sics.se/sicstus/docs/4.6.0/html/sicstus/ref_002dsem_002docc.html

(**)
Because of the infinite looping, their brains might
also get into infinite loops. Even fuzzy testing does
not help anymore breaking these loops.

--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

What happened recently? They all run on low fuel
CPU ( GPU / TPU ) now. Have to explain:

reCXreCYreCZ (Q(X,Z) reo R(Z,Y) raA P(X,Y)) is equivalent to:

reCXreCYreCZ (~(Q(X,Z) reo R(Z,Y)) v P(X,Y)) is equivalent to:

reCXreCY (reCZ ~(Q(X,Z) reo R(Z,Y)) v P(X,Y)) is equivalent to:

reCXreCY (~reaZ (Q(X,Z) reo R(Z,Y)) v P(X,Y)) is equivalent to:

reCXreCY (reaZ (Q(X,Z) reo R(Z,Y)) raA P(X,Y))

Bye

Mild Shock schrieb:

Hi,

The Latin cogito, ergo sum, usually translated
into English as "I think, therefore I am",[a]
is the "first principle" of the philosophy of
the French scientist and philosopher Ren|- Descartes.

The new CogitoAI System features explanation
compression using the motto:

**********************************************
Search First, Explain Later
**********************************************

Its very easy to implement, and based on intuitionist
logic Curry Howard exists witness terms, a rule:

P(X, Y) :- Q(X, Z), R(Z, Y).

Is transformed into, combining existential and conjunction:

P(X, Y, rule(Z, S, T)) :- Q(X, Z, S), R(Z, Y, T).

So the search will only return the compressed form
you can later generate fancy trees, with fact
prevenance, rule references, coloring, bells and

whistles. Dunno, just an idea based on:

formalise existential quantification by
declaring a suitable record type https://plfa.github.io/Quantifiers/#existentials

LoL

Bye

Mild Shock schrieb:

Hi,

The diagram figure 2 here:

Fifty Years of Prolog and Beyond (TPLP 2022)
K|uRNER P, LEUSCHEL M, BARBOSA J, et al. Fifty Years of Prolog and
Beyond. Theory and Practice of Logic Programming.
2022;22(6):776-858. doi:10.1017/S1471068422000102

And reproduced here:

Comparison of Prolog implementations
The page has also missing Scryer Prolog, which
I think is an important Prolog system written in
Rust, because it also pays tribute to Prolog II.
https://en.wikipedia.org/wiki/Comparison_of_Prolog_implementations

Is pretty much brainwashed nonsense. Most Prolog
systems, that have cyclic terms, are derived from
Prolog II.-a Adopting a non-canonical rational tree

term approach. This includes:

- SICStus Prolog
- Ciao Prolog
- YAP Prolog
- SWI-Prolog
- Scryer Prolog
- Trealla Prolog
- Dogelog Player
- What else?

SICStus Prolog is possibly the most advanced, (*)
it also supports asserts and copying, whereas I found
not all Prolog systems listed above can even

copy cyclic terms, despite they can unify them.
Basically the philogeny of Prolog systems is
not some "single inheritance" tree. Cyclic terms

algorithm have nice side effect that they might
speed up acyclic term arguments as well. But
cyclic terms is one of the topics that is very

badily-a covered, for some individuals difficult (**)
to understand and sometimes even completely ignored.

Bye

(*)
SICStus Prolog unifies, compares (see ref-lte-cte),
asserts, and copies cyclic terms without looping.
The write_term/[2,3] built-in predicate can
optionally handle cyclic terms.
https://sicstus.sics.se/sicstus/docs/4.6.0/html/sicstus/ref_002dsem_002docc.html


(**)
Because of the infinite looping, their brains might
also get into infinite loops. Even fuzzy testing does
not help anymore breaking these loops.

--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

Why even go into the hussle to store anything.
If you have Q and R anyways tabled? You can go
with your answer X and Y, into this subquery,

and choose an arbitrary Z:

reaZ (Q(X,Z) reo R(Z,Y))

As your explanation. And do this recursively.
This would be the original gangster (OG) of.
Its basically the "wait, let me explain":

**********************************************
Search First, Explain Later
**********************************************

This is what cognitive science told us already
for years, Consciousness is only a "hick up".
Well you have to be quick, its really only "hick up".

If the tabling gets flushed it doesn't
work so easily anymore.

Bye

Mild Shock schrieb:

Hi,

What happened recently? They all run on low fuel
CPU ( GPU / TPU ) now. Have to explain:

reCXreCYreCZ (Q(X,Z) reo R(Z,Y) raA P(X,Y)) is equivalent to:

reCXreCYreCZ (~(Q(X,Z) reo R(Z,Y)) v P(X,Y))-a is equivalent to:

reCXreCY (reCZ ~(Q(X,Z) reo R(Z,Y)) v P(X,Y))-a is equivalent to:

reCXreCY (~reaZ (Q(X,Z) reo R(Z,Y)) v P(X,Y))-a is equivalent to:

reCXreCY (reaZ (Q(X,Z) reo R(Z,Y)) raA P(X,Y))

Bye

Mild Shock schrieb:

Hi,

The Latin cogito, ergo sum, usually translated
into English as "I think, therefore I am",[a]
is the "first principle" of the philosophy of
the French scientist and philosopher Ren|- Descartes.

The new CogitoAI System features explanation
compression using the motto:

**********************************************
Search First, Explain Later
**********************************************

Its very easy to implement, and based on intuitionist
logic Curry Howard exists witness terms, a rule:

P(X, Y) :- Q(X, Z), R(Z, Y).

Is transformed into, combining existential and conjunction:

P(X, Y, rule(Z, S, T)) :- Q(X, Z, S), R(Z, Y, T).

So the search will only return the compressed form
you can later generate fancy trees, with fact
prevenance, rule references, coloring, bells and

whistles. Dunno, just an idea based on:

formalise existential quantification by
declaring a suitable record type
https://plfa.github.io/Quantifiers/#existentials

LoL

Bye

Mild Shock schrieb:

Hi,

The diagram figure 2 here:

Fifty Years of Prolog and Beyond (TPLP 2022)
K|uRNER P, LEUSCHEL M, BARBOSA J, et al. Fifty Years of Prolog and
Beyond. Theory and Practice of Logic Programming.
2022;22(6):776-858. doi:10.1017/S1471068422000102

And reproduced here:

Comparison of Prolog implementations
The page has also missing Scryer Prolog, which
I think is an important Prolog system written in
Rust, because it also pays tribute to Prolog II.
https://en.wikipedia.org/wiki/Comparison_of_Prolog_implementations

Is pretty much brainwashed nonsense. Most Prolog
systems, that have cyclic terms, are derived from
Prolog II.-a Adopting a non-canonical rational tree

term approach. This includes:

- SICStus Prolog
- Ciao Prolog
- YAP Prolog
- SWI-Prolog
- Scryer Prolog
- Trealla Prolog
- Dogelog Player
- What else?

SICStus Prolog is possibly the most advanced, (*)
it also supports asserts and copying, whereas I found
not all Prolog systems listed above can even

copy cyclic terms, despite they can unify them.
Basically the philogeny of Prolog systems is
not some "single inheritance" tree. Cyclic terms

algorithm have nice side effect that they might
speed up acyclic term arguments as well. But
cyclic terms is one of the topics that is very

badily-a covered, for some individuals difficult (**)
to understand and sometimes even completely ignored.

Bye

(*)
SICStus Prolog unifies, compares (see ref-lte-cte),
asserts, and copies cyclic terms without looping.
The write_term/[2,3] built-in predicate can
optionally handle cyclic terms.
https://sicstus.sics.se/sicstus/docs/4.6.0/html/sicstus/ref_002dsem_002docc.html


(**)
Because of the infinite looping, their brains might
also get into infinite loops. Even fuzzy testing does
not help anymore breaking these loops.

--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

Now I get finger licking feelings to get my
hands on some of NVIDIA DGX or something
machines with 1000 TOPS or something.

Interestingly their Blackwell 2024 series,
is a tribute to David Blackwell (1919 - 2010),
who co-authored typical post WWII and

pre Cold War "strategic" mathematics:

Bayes and Minimax Solutions of Sequential Decision Problems
Author(s): K. J. Arrow, D. Blackwell and M. A. Girshick
Source: Econometrica, Vol. 17, No. 3/4 (Jul. - Oct., 1949), pp. 213-244

Is this basic statistics or neuro symbolic?

Bye

P.S.: Nice and maybe easy special case:

3. OPTIMUM SEQUENTIAL PROCEDURE FOR A
DICHOTOMY WHEN THE COST FUNCTION IS LINEAR
We are given two alternative hypotheses H1 and H2,
which, for the sake of simplicity, we assume are
characterized respectively by two probability densities
f1(x) and f2(x) of a random vector X in an R dimensional
Euclidean space. Etc.. Etc..

Mild Shock schrieb:

Hi,

The Latin cogito, ergo sum, usually translated
into English as "I think, therefore I am",[a]
is the "first principle" of the philosophy of
the French scientist and philosopher Ren|- Descartes.

The new CogitoAI System features explanation
compression using the motto:

**********************************************
Search First, Explain Later
**********************************************

Its very easy to implement, and based on intuitionist
logic Curry Howard exists witness terms, a rule:

P(X, Y) :- Q(X, Z), R(Z, Y).

Is transformed into, combining existential and conjunction:

P(X, Y, rule(Z, S, T)) :- Q(X, Z, S), R(Z, Y, T).

So the search will only return the compressed form
you can later generate fancy trees, with fact
prevenance, rule references, coloring, bells and

whistles. Dunno, just an idea based on:

formalise existential quantification by
declaring a suitable record type https://plfa.github.io/Quantifiers/#existentials

LoL

Bye

Mild Shock schrieb:

Hi,

The diagram figure 2 here:

Fifty Years of Prolog and Beyond (TPLP 2022)
K|uRNER P, LEUSCHEL M, BARBOSA J, et al. Fifty Years of Prolog and
Beyond. Theory and Practice of Logic Programming.
2022;22(6):776-858. doi:10.1017/S1471068422000102

And reproduced here:

Comparison of Prolog implementations
The page has also missing Scryer Prolog, which
I think is an important Prolog system written in
Rust, because it also pays tribute to Prolog II.
https://en.wikipedia.org/wiki/Comparison_of_Prolog_implementations

Is pretty much brainwashed nonsense. Most Prolog
systems, that have cyclic terms, are derived from
Prolog II.-a Adopting a non-canonical rational tree

term approach. This includes:

- SICStus Prolog
- Ciao Prolog
- YAP Prolog
- SWI-Prolog
- Scryer Prolog
- Trealla Prolog
- Dogelog Player
- What else?

SICStus Prolog is possibly the most advanced, (*)
it also supports asserts and copying, whereas I found
not all Prolog systems listed above can even

copy cyclic terms, despite they can unify them.
Basically the philogeny of Prolog systems is
not some "single inheritance" tree. Cyclic terms

algorithm have nice side effect that they might
speed up acyclic term arguments as well. But
cyclic terms is one of the topics that is very

badily-a covered, for some individuals difficult (**)
to understand and sometimes even completely ignored.

Bye

(*)
SICStus Prolog unifies, compares (see ref-lte-cte),
asserts, and copies cyclic terms without looping.
The write_term/[2,3] built-in predicate can
optionally handle cyclic terms.
https://sicstus.sics.se/sicstus/docs/4.6.0/html/sicstus/ref_002dsem_002docc.html


(**)
Because of the infinite looping, their brains might
also get into infinite loops. Even fuzzy testing does
not help anymore breaking these loops.

--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

Hi,

Some companies are now selling laboratory
equipement, based on:

"Clinical reflex testing in virology is an automated
laboratory practice where an initial positive screening
test result automatically triggers a second, confirmatory,
or more specific test on the same patient sample." https://pmc.ncbi.nlm.nih.gov/articles/PMC9425021/

Whats the math behind it?
Basic statistics or neuro symbolic?

Bye

Could be useful for:

Hantavirus-Ausbruch auf Kreuzfahrtschiff:
DIESE Symptome muss man jetzt beachten! https://www.youtube.com/watch?v=lzNy0Lu3wM0

Happy fear mongering!

Mild Shock schrieb:

Hi,

Now I get finger licking feelings to get my
hands on some of NVIDIA DGX or something
machines with 1000 TOPS or something.

Interestingly their Blackwell 2024 series,
is a tribute to David Blackwell (1919 - 2010),
who co-authored typical post WWII and

pre Cold War "strategic" mathematics:

Bayes and Minimax Solutions of Sequential Decision Problems
Author(s): K. J. Arrow, D. Blackwell and M. A. Girshick
Source: Econometrica, Vol. 17, No. 3/4 (Jul. - Oct., 1949), pp. 213-244

Is this basic statistics or neuro symbolic?

Bye

P.S.: Nice and maybe easy special case:

3. OPTIMUM SEQUENTIAL PROCEDURE FOR A
DICHOTOMY WHEN THE COST FUNCTION IS LINEAR
We are given two alternative hypotheses H1 and H2,
which, for the-a sake of simplicity, we assume are
characterized respectively by two probability densities
f1(x) and f2(x) of a random vector X in an R dimensional
Euclidean space. Etc.. Etc..

--- Synchronet 3.21f-Linux NewsLink 1.2