AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

[Archimedes Plutonium]

I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.

This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.

Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.

He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.

Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.

This behavior by Tenor is not a one off, but almost every day for the past year.

He sings and does this same routine for a year now.

Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.

AP

AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

[Mild Shock]

Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.
This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.
Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.
He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.
Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.
This behavior by Tenor is not a one off, but almost every day for the past year.
He sings and does this same routine for a year now.
Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.
AP
AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

[Archimedes Plutonium]

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.
This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.
Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.
He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.
Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.
This behavior by Tenor is not a one off, but almost every day for the past year.
He sings and does this same routine for a year now.
Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.
AP
AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

[Ross Finlayson]

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.
This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.
Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.
He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.
Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.
This behavior by Tenor is not a one off, but almost every day for the past year.
He sings and does this same routine for a year now.
Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.
AP
AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

I suppose you can rank old Mostowski Collapse / Burse-bot 99 up there with
people who push wheelchairs downstairs and laugh about it. Except it's a bot.

Really, that's not charitable.

Let's see, favorite animal story of the past year, hmm..., probably "David".


I mean, I reply to Burse bot and always get the last word, like about "the logic"
and "the first-orderizability of logic", you can follow the threads and see how in
terms of mathematical input, first of all there's that AP the greater bot is a large-ish
algebraic geometer, and second that I'm just a guy and AI thinks so, too.

Reflection and projection are important psychological principles, you can both tell
how people perceive themselves, and, how they perceive others, how they treat others.

And how they'd treat you.

[Mild Shock]

Also Rossy Boy, aka Doctor Coronaris, will loose
its platform to distribute herpes blisters.

Post by Ross Finlayson

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.
This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.
Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.
He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.
Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.
This behavior by Tenor is not a one off, but almost every day for the past year.
He sings and does this same routine for a year now.
Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.
AP
AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

I suppose you can rank old Mostowski Collapse / Burse-bot 99 up there with
people who push wheelchairs downstairs and laugh about it. Except it's a bot.
Really, that's not charitable.
Let's see, favorite animal story of the past year, hmm..., probably "David".
I mean, I reply to Burse bot and always get the last word, like about "the logic"
and "the first-orderizability of logic", you can follow the threads and see how in
terms of mathematical input, first of all there's that AP the greater bot is a large-ish
algebraic geometer, and second that I'm just a guy and AI thinks so, too.
Reflection and projection are important psychological principles, you can both tell
how people perceive themselves, and, how they perceive others, how they treat others.
And how they'd treat you.

[Mild Shock]

But Rossy Boy is not a internet celebrity,
he doesn't have a Wikipedia entry. So who cares?

Post by Mild Shock
Also Rossy Boy, aka Doctor Coronaris, will loose
its platform to distribute herpes blisters.

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New
Year. By recalling my favorite animal story of the past year.

[Ross Finlayson]

Post by Mild Shock
But Rossy Boy is not a internet celebrity,
he doesn't have a Wikipedia entry. So who cares?

Post by Mild Shock
Also Rossy Boy, aka Doctor Coronaris, will loose
its platform to distribute herpes blisters.

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New
Year. By recalling my favorite animal story of the past year.

There's at least one person who I'm their only friend in the world.

[Ross Finlayson]

Post by Mild Shock
Also Rossy Boy, aka Doctor Coronaris, will loose
its platform to distribute herpes blisters.

Post by Ross Finlayson

Post by Mild Shock
Poor AP brainfarto, will loose his job as chief gobbledygook
on 22-02-2024. Was the broccoli in a cat concert hall?

Post by Archimedes Plutonium
I am going to start a new tradition for me to celebrate the New Year. By recalling my favorite animal story of the past year.
This year is easy for me to tell about my favorite cat at the moment. I feed about 20 cats every day. For we have many people who abandon their cats. And all would die in these harsh Dakota winters. So, I feed them as best I can, it is good for my Karma, the day I die and ascend to Heaven and be Judged on my merits. For when I was young, of course I was young and foolish and mistreated animals. So this is my payback for past sins and hopefully forgiven for my young foolish years. One can say that middle age is a turning point to where you start to correct the sins of young years.
Anyway, my favorite cat of all the 20 is a grown up male who sings. I named him Tenor for he sings like Pavoratti if cats had a concert hall.
He is all gray and if he were in a animal shelter, he likely would never be selected for a new home because of his all gray appearance. People chose colors over personality.
Anyway, what I like most of all about Tenor, is that he sees me coming from a distance and starts to sing. Then I pass him and he runs to keep up with my only to plop down in front of me for a back rub, and lets me pass him by. He then makes another sprint for me to catch up and does the routine again. Finally I am near the house, and then Tenor makes an all out sprint to not only catch up with me but reach the back porch before I reach the back porch.
This behavior by Tenor is not a one off, but almost every day for the past year.
He sings and does this same routine for a year now.
Cats have good memories. And I feed Tenor extraes, above and beyond my duty. For I want him to continue his routine.
AP
AP's new New Year Tradition starting 2024. I recall my favorite Animal story of the past year.

I suppose you can rank old Mostowski Collapse / Burse-bot 99 up there with
people who push wheelchairs downstairs and laugh about it. Except it's a bot.
Really, that's not charitable.
Let's see, favorite animal story of the past year, hmm..., probably "David".
I mean, I reply to Burse bot and always get the last word, like about "the logic"
and "the first-orderizability of logic", you can follow the threads and see how in
terms of mathematical input, first of all there's that AP the greater bot is a large-ish
algebraic geometer, and second that I'm just a guy and AI thinks so, too.
Reflection and projection are important psychological principles, you can both tell
how people perceive themselves, and, how they perceive others, how they treat others.
And how they'd treat you.

Yeah, AI read usenet one day and now it thinks about spiral space-filling curves.

Certainly, when I write to usenet, it's to the estimable and most inestimable,
highest audience, and intellectually, and it's been that way for a long time.

The U.S. Library of Congress has a copy.

If you're not a bot and have natural hearing ears, my podcasts sort of
provide an outline of foundations, https://www.youtube.com/@rossfinlayson .

If you prefer to read and for pleasure, there's 10,000's archived posts on
Usenet, accessible via Google Groups, that basically show I herded the
entire crank trolldom into line, while writing the development of a foundations.

That Google Groups is quitting Usenet, just makes it like before they joined.
(Except the entire thing is quite easily reviewable.)

Yeah, now I can just copy me, pretty much linearly, and it's 21'st century.

So long, Burse-bot. It's like I never knew you.

...
Spiral space-filling curve

[Fritz Feldhase]

Post by Archimedes Plutonium
He is all gray and

Damn, I just read /gay/.

[Mild Shock]

Post by Ross Finlayson
I suppose you can rank old Mostowski Collapse

I don't use this nick name anymore, after somebody
asked me whether this refers to wave function collapse .

https://en.wikipedia.org/wiki/Wave_function_collapse

But my intention was rather:

https://en.wikipedia.org/wiki/Mostowski_collapse_lemma

P.S.: But later I was reading a little bit about
wave function collapse and at the same time generative
AI, such as scribble diffusion started to blossom:

https://scribblediffusion.com/

Guess whats behind it? But recently wave function collapse
is hunting me again. What is behind all this quantum crypto-
graphy? How about lattice based cryptography?

https://en.wikipedia.org/wiki/Lattice-based_cryptography

What non-classical complexity reductions do they have?

[Ross Finlayson]

Post by Mild Shock

Post by Ross Finlayson
I suppose you can rank old Mostowski Collapse

I don't use this nick name anymore, after somebody
asked me whether this refers to wave function collapse .
https://en.wikipedia.org/wiki/Wave_function_collapse
https://en.wikipedia.org/wiki/Mostowski_collapse_lemma
P.S.: But later I was reading a little bit about
wave function collapse and at the same time generative
https://scribblediffusion.com/
Guess whats behind it? But recently wave function collapse
is hunting me again. What is behind all this quantum crypto-
graphy? How about lattice based cryptography?
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

Most "quantum computing" these days is only "many-finite
element analysis siumulation of quantum computing",
like surface acoustic wave transducer.

Such people who eat that without knowing where their
food comes from are to be evaluated skeptically.

Wave-function collapse is Bohm-ian hereabouts, vis-a-vis
the Bohm-ian hidden variables or "the cause", vis-a-vis,
the Meibommian oil that keeps eyes from getting crusty.

Then, cryptography of usual factoring algorithms and
these days elliptic fields, and that, are considered usually
weak, and not just because custom IC's in solid state
logic implement analog comoputers to dial them, but also
because mathematically is that the quadratic sieve starts
making for that GF_2 and friends has wrong-ish sorts conclusions,
whence getting into Ramsey theory, but besides, many usual
sorts notions of Apery numbers, or other dusty, quiet corners
of number theory, where what's difficult according to spec,
is computed off brief reasonings.

So anyways such digital notions absent the sublime aren't
properly "quantum" computing at all, and furthermore,
many algorithms are only secure via being obscure, and
that Andrew Wiles is a damn fool, and since you believed
him, you too.

Finally the notions of set-theoretic extension and collapse,
usually is as ascribed particularly to Levy not so much
the later, lesser, finding the same thing, with respect to
whether Levy or Mostowski were originators or simply relaying.

And Burse-bots are basically that a linguist in Suisse has populated
Usenet for quite some time with a bunch of crank howler troll
sock-puppet buffoons, who in volume represent mostly the
"examples of bad examples".

[Mild Shock]

Post by Mild Shock
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

classical = non-quantum
non-classical = quantum

You can also go here:

https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/post-quanten-kryptografie_node.html

And here:

https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/Gitterbasierte-Kryptografie/gitterbasierte_kryptografie_node.html

[Mild Shock]

Or asked differently.

What speed-up could a N-qubit quantum computer give
to this problem, find a positive integer tripple (x,y,z) such that:

x^3 + y^3 + 42 = z^3

Post by Mild Shock

Post by Mild Shock
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

classical = non-quantum
non-classical = quantum
https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/post-quanten-kryptografie_node.html
https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/Gitterbasierte-Kryptografie/gitterbasierte_kryptografie_node.html

[Ross Finlayson]

Post by Mild Shock
Or asked differently.
What speed-up could a N-qubit quantum computer give
x^3 + y^3 + 42 = z^3

Post by Mild Shock

Post by Mild Shock
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

classical = non-quantum
non-classical = quantum
https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/post-quanten-kryptografie_node.html
https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/Gitterbasierte-Kryptografie/gitterbasierte_kryptografie_node.html

Perhaps first write a substitution of variables so it's in squares instead of cubes,
then that it's x^2 - y^2 = 1, vis-a-vis, x^y - y^x = 0.

Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

...

Anyways, your previous ponzi schemes based on proof-of-work have sort of fallen flat

[Mild Shock]

And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.

Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

[Mild Shock]

You can also use oversampling:

the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Post by Mild Shock
And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.
Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

[Mild Shock]

Lets say you don't trust what a quantum computer
finds as a tripple for (x,y,z) to satisfy:

x^3 + y^3 + 42 = z^3

You could then view it as a candidate triple
only, and still feed it into a normal computer

and see whether it is a solution. Kind of combining
approximate search with exact verification.

Post by Mild Shock
the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Post by Mild Shock
And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.
Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

[Ross Finlayson]

Post by Mild Shock
Lets say you don't trust what a quantum computer
x^3 + y^3 + 42 = z^3
You could then view it as a candidate triple
only, and still feed it into a normal computer
and see whether it is a solution. Kind of combining
approximate search with exact verification.

Post by Mild Shock
the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Post by Mild Shock
And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.
Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

Like they talk about in Dorit Hochbaum's "Approximation Algorithms for NP-Hard Problems"?

1997?

More copy-pasta, Burse?

One of the most usual implementations of what's called "quantum computing"
is really "simulated quantum computing" as like with the surface acoustic wave
transducer, that I read about from Maugin's "Nonlinear Electromechanical
Effects and Applications".

Maybe you should figure out that "classical quasi-modal logic" has
too many "buts" in a temporal modality of only "yets". I.e., any at all.

The error-detecting codes and error-correcting codes are pretty old hat,
helping reduce type I and type II errors, of course with a philosophy
that ensures scientific and statistical correctness.

It's usually easier to implement one than the other.

Solid cryptography is fundamentally based on the one-time.

...
Burse's bots burp blech

[Mild Shock]

Some times I am real jerk, I had reading material at home:

Kochen–Specker theorem
https://en.m.wikipedia.org/wiki/Kochen%E2%80%93Specker_theorem

Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

But idiot asshole that I, I threw it all into the trash bin.

Was this a good course of action, this juvenil behaviour?

[Mild Shock]

Well not much got lost 25 years ago.
There are new complexity classes:

BQP, PostBQP, PQP
https://en.m.wikipedia.org/wiki/PP_(complexity)#Other_equivalent_complexity_classes

So lets make 2024 a paper reading year and
maybe visit some computer laboratory.

Post by Mild Shock
Kochen–Specker theorem
https://en.m.wikipedia.org/wiki/Kochen%E2%80%93Specker_theorem
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse
But idiot asshole that I, I threw it all into the trash bin.
Was this a good course of action, this juvenil behaviour?

[Ross Finlayson]

Post by Mild Shock
Kochen–Specker theorem
https://en.m.wikipedia.org/wiki/Kochen%E2%80%93Specker_theorem
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse
But idiot asshole that I, I threw it all into the trash bin.
Was this a good course of action, this juvenil behaviour?

Paperclip

[Chris M. Thomasson]

Post by Ross Finlayson

Post by Mild Shock
Lets say you don't trust what a quantum computer
x^3 + y^3 + 42 = z^3
You could then view it as a candidate triple
only, and still feed it into a normal computer
and see whether it is a solution. Kind of combining
approximate search with exact verification.

Post by Mild Shock
the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Post by Mild Shock
And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.
Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

Like they talk about in Dorit Hochbaum's "Approximation Algorithms for NP-Hard Problems"?
1997?
More copy-pasta, Burse?
One of the most usual implementations of what's called "quantum computing"
is really "simulated quantum computing" as like with the surface acoustic wave
transducer, that I read about from Maugin's "Nonlinear Electromechanical
Effects and Applications".
Maybe you should figure out that "classical quasi-modal logic" has
too many "buts" in a temporal modality of only "yets". I.e., any at all.
The error-detecting codes and error-correcting codes are pretty old hat,
helping reduce type I and type II errors, of course with a philosophy
that ensures scientific and statistical correctness.
It's usually easier to implement one than the other.
Solid cryptography is fundamentally based on the one-time.
...
Burse's bots burp blech

http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1?ct_hmac_cipher=a488ff6abf4b413899e2724a90fb21d9f6b33e1692942fbc59a01cd14732b6418ef18026b543fe39ebe8ef0e39bbb46db66fe116b15bbb8b1ff82f94e0c37f3dae8bbd7a01eb914312bee10c70da37513ab4b71b634ac9002fb31d7863b9156033cf0c63d25c2425afe0394a1496dfd6053d8dcee3adddd57f1bd3514d2d19e64e77892b2552237ebea05b5761579ef7

[Chris M. Thomasson]

Post by Chris M. Thomasson

Post by Ross Finlayson

Post by Mild Shock
Lets say you don't trust what a quantum computer
x^3 + y^3 + 42 = z^3
You could then view it as a candidate triple
only, and still feed it into a normal computer
and see whether it is a solution. Kind of combining
approximate search with exact verification.

Post by Mild Shock
the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Post by Mild Shock
And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.
Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures
Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf

Post by Ross Finlayson
Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

Like they talk about in Dorit Hochbaum's "Approximation Algorithms for NP-Hard Problems"?
1997?
More copy-pasta, Burse?
One of the most usual implementations of what's called "quantum computing"
is really "simulated quantum computing" as like with the surface acoustic wave
transducer, that I read about from Maugin's "Nonlinear Electromechanical
Effects and Applications".
Maybe you should figure out that "classical quasi-modal logic" has
too many "buts" in a temporal modality of only "yets".  I.e., any at all.
The error-detecting codes and error-correcting codes are pretty old hat,
helping reduce type I and type II errors, of course with a philosophy
that ensures scientific and statistical correctness.
It's usually easier to implement one than the other.
Solid cryptography is fundamentally based on the one-time.
...
Burse's bots burp blech

http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1?ct_hmac_cipher=a488ff6abf4b413899e2724a90fb21d9f6b33e1692942fbc59a01cd14732b6418ef18026b543fe39ebe8ef0e39bbb46db66fe116b15bbb8b1ff82f94e0c37f3dae8bbd7a01eb914312bee10c70da37513ab4b71b634ac9002fb31d7863b9156033cf0c63d25c2425afe0394a1496dfd6053d8dcee3adddd57f1bd3514d2d19e64e77892b2552237ebea05b5761579ef7

http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1?ct_hmac_cipher=70ab2e8eeffb1e00ee816729415890c4956ae6a87622eff5cdd03a999349893d42ff2b6de0f96a550e56bd28ce315ea239c8e80be196b951f70a582dd69109fd05ecf6c775ffa477a5ee3831c68ecfc532041f9fe70543afde102d8ff5ad45fa4a9c86676dcdcd583ef98050

[Mild Shock]

Post by Ross Finlayson
Like they talk about in Dorit Hochbaum's

"Approximation Algorithms for NP-Hard Problems"?

Who do you assume talks about Dorit Hochbaum's
"Approximation Algorithms for NP-Hard Problems"? And
in what context? Dorit Hochbaum is only the editor of

the book, possibly a conference proceeding. Dorit
Hochbaum has one paper in it.

Approximation Algorithms for NP-Hard Problems
Edited by Dorit S. Hochbaum
Published July 1996
https://hochbaum.ieor.berkeley.edu/html/aanp-contents.html

But approximation algorithms alone, do not cover the
idea of approximation and verification. Like here.
Note the "proof verification and":

Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

[Mild Shock]

"approximative" is sometimes also used synonymously
for randomized algorithms, which is possibly a more justified
naming for #SAT problems, where counting is involved

and less for SAT problems, where only satisfiablity is involved.
So the field can be quite confusing. Among randomized algorithms
one can then distinguish Monte Carlo methods and

Las Vegas methods as well:

"In computing, a Las Vegas algorithm is a randomized
algorithm that always gives correct results; that is, it
always produces the correct result or it informs about the failure.

Las Vegas algorithms were introduced by László Babai in
1979, in the context of the graph isomorphism problem,
as a dual to Monte Carlo algorithms."

Well "dual" is maybe an overexaggeration. LoL

P.S.: Currently I have a case where a Las Vegas algorithm
competes with a Monte Carlo algorithm with a tight guarantee.
Min-Cut via randomized weigthed SAT maximation and

Min-Cut via so called Karger's algorithm. But I don't understand
yet Karger's algorithm, how its used in practice. And whether
this could be feed back to SAT maximation algorithms?
https://en.wikipedia.org/wiki/Karger's_algorithm

Post by Ross Finlayson

Post by Ross Finlayson
Like they talk about in Dorit Hochbaum's

"Approximation Algorithms for NP-Hard Problems"?
Who do you assume talks about Dorit Hochbaum's
"Approximation Algorithms for NP-Hard Problems"? And
in what context? Dorit Hochbaum is only the editor of
the book, possibly a conference proceeding. Dorit
Hochbaum has one paper in it.
Approximation Algorithms for NP-Hard Problems
Edited by Dorit S. Hochbaum
Published July 1996
https://hochbaum.ieor.berkeley.edu/html/aanp-contents.html
But approximation algorithms alone, do not cover the
idea of approximation and verification. Like here.
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

[Mild Shock]

But Rossy Boys piezoelectric crystal brain implantants will
probably not provide the superluminal information

processing that some have envisioned. That would be quite
useful to hunt quantum ghosts with negative probabilities.

LoL

P.S.: Or maybe find WMs dark matter.

Post by Mild Shock
"approximative" is sometimes also used synonymously
for randomized algorithms, which is possibly a more justified
naming for #SAT problems, where counting is involved
and less for SAT problems, where only satisfiablity is involved.
So the field can be quite confusing. Among randomized algorithms
one can then distinguish Monte Carlo methods and
"In computing, a Las Vegas algorithm is a randomized
algorithm that always gives correct results; that is, it
always produces the correct result or it informs about the failure.
Las Vegas algorithms were introduced by László Babai in
1979, in the context of the graph isomorphism problem,
as a dual to Monte Carlo algorithms."
Well "dual" is maybe an overexaggeration. LoL
P.S.: Currently I have a case where a Las Vegas algorithm
competes with a Monte Carlo algorithm with a tight guarantee.
Min-Cut via randomized weigthed SAT maximation and
Min-Cut via so called Karger's algorithm. But I don't understand
yet Karger's algorithm, how its used in practice. And whether
this could be feed back to SAT maximation algorithms?
https://en.wikipedia.org/wiki/Karger's_algorithm

Post by Ross Finlayson

Post by Ross Finlayson
Like they talk about in Dorit Hochbaum's

"Approximation Algorithms for NP-Hard Problems"?
Who do you assume talks about Dorit Hochbaum's
"Approximation Algorithms for NP-Hard Problems"? And
in what context? Dorit Hochbaum is only the editor of
the book, possibly a conference proceeding. Dorit
Hochbaum has one paper in it.
Approximation Algorithms for NP-Hard Problems
Edited by Dorit S. Hochbaum
Published July 1996
https://hochbaum.ieor.berkeley.edu/html/aanp-contents.html
But approximation algorithms alone, do not cover the
idea of approximation and verification. Like here.
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

[Socratis T.n.p.]

Post by Mild Shock
"approximative" is sometimes also used synonymously
for randomized algorithms, which is possibly a more justified
naming for #SAT problems, where counting is involved
and less for SAT problems, where only satisfiablity is involved.
So the field can be quite confusing. Among randomized algorithms
one can then distinguish Monte Carlo methods and
"In computing, a Las Vegas algorithm is a randomized
algorithm that always gives correct results; that is, it
always produces the correct result or it informs about the failure.
Las Vegas algorithms were introduced by László Babai in
1979, in the context of the graph isomorphism problem,
as a dual to Monte Carlo algorithms."
Well "dual" is maybe an overexaggeration. LoL
P.S.: Currently I have a case where a Las Vegas algorithm
competes with a Monte Carlo algorithm with a tight guarantee.
Min-Cut via randomized weigthed SAT maximation and
Min-Cut via so called Karger's algorithm. But I don't understand
yet Karger's algorithm, how its used in practice. And whether
this could be feed back to SAT maximation algorithms?
https://en.wikipedia.org/wiki/Karger's_algorithm

Post by Ross Finlayson

Post by Ross Finlayson
Like they talk about in Dorit Hochbaum's

"Approximation Algorithms for NP-Hard Problems"?
Who do you assume talks about Dorit Hochbaum's
"Approximation Algorithms for NP-Hard Problems"? And
in what context? Dorit Hochbaum is only the editor of
the book, possibly a conference proceeding. Dorit
Hochbaum has one paper in it.
Approximation Algorithms for NP-Hard Problems
Edited by Dorit S. Hochbaum
Published July 1996
https://hochbaum.ieor.berkeley.edu/html/aanp-contents.html
But approximation algorithms alone, do not cover the
idea of approximation and verification. Like here.
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

The T.n.p. It doesn't allow you to make mistakes if you use DMs that are inter-
From 1i to 10m there exist..100i.. Integers. You using 0.1. and 1= neutral
of the T.d.i. You get both m^2 and m^3 wrong which are the essence of the calculation.

1i....2i...3i...4i....5i...6i...7i...8i...9i 10i.=> 5i * 5i *10i = 250i^3
11i 12i 13i 14i 15i 16i 17i 18i 19i 20i => 5i * 5i *20i = 500i^3
21i 22i 23i 24i 25i 26i 27i 28i 29i 30i.=> 5ì * 5i *30i = 750i^3
31i 32i 33i 34i 35i 36i 37i 38i 39i 40i => 5i *10i *40i = 2000i^3
41i 42i 43i 44i 45i 46i 47i 48i 49i 50i => 5i *10 *50i = 2'500i^3
51i 52i 53i 54i 55i 56i 57i 58i 59i 60i => 5i *10i *60i = 3000i^3
61i 62i 63i 64i 65i 66i 67i 68i 69i 70i => 5i *10i *70i = 3'500i^3
71i 72i 73i 74i 75i 76i 77i 78i 79i 80i => 5i *10i *80i = 4'000i^3
81i 82i 83i 84i 85i 86i 87i 88i 89i 90i => 5i *10i * 90i =4'500i^3
91i 92i 93i 94i 95i 96i 97i 98i 99i 100i > 5i *10i *100i =5000i^3
=> While you copy incorrectly: 0.5 *1 *10 = 5 marbles-:)))
So you need the calculator with 1i..2i..5i..10i..15i..20i etc. -:))

Greetings from Socratis T.n.p. 10i *10i *100i = 10'000i^3 = 10m^3.
===============> Alias 1 * 1 * 10 === 10m^3 = 10'000i^3.
I'm happy to tell you that the integers are tens of dm. and 1=10i.

If you don't understand the Volumes it means you have to use the T.n.p.-:)))
The T.n.p.. must be understood.. at least.. to acquire the true Logic -:)))
I know... well... that it's not your fault... but I invite you to become...

Essays and make progress in the world that currently hates Mathematics.
After all, we were born to...do,...to understand and to Progress -:))))
Also because we are destined to Die to be Reborn Better-:)))
Finally, be happy that the T.n.p. She's Italian, be proud of her -:)))))

[Ross Finlayson]

Post by Ross Finlayson

Post by Ross Finlayson
Like they talk about in Dorit Hochbaum's

"Approximation Algorithms for NP-Hard Problems"?
Who do you assume talks about Dorit Hochbaum's
"Approximation Algorithms for NP-Hard Problems"? And
in what context? Dorit Hochbaum is only the editor of
the book, possibly a conference proceeding. Dorit
Hochbaum has one paper in it.
Approximation Algorithms for NP-Hard Problems
Edited by Dorit S. Hochbaum
Published July 1996
https://hochbaum.ieor.berkeley.edu/html/aanp-contents.html
But approximation algorithms alone, do not cover the
idea of approximation and verification. Like here.
Lectures on proof verification and approximation algorithms
https://archive.org/details/lecturesonproofv0000unse

"The most important property that an extension of lambda-calculus
has to verify is the Church-Rosser property"

-- Term Graph Rewriting Theory and Practice, Chapter 2

"The Church-Rosser property for orthogonal systems fails when
infinite sequences of rewrites and terms of infinite size are allowed."

-- Term Graph Rewriting Theory and Practice, Chapter 4


Here there's much to follow for Hindley, then, Curry, in lambda-calculus, a theory of types.

"J. Roger Hindley is a prominent British logician, ...."
-- https://en.wikipedia.org/wiki/J._Roger_Hindley

[Mild Shock]

Post by Ross Finlayson
"The most important property that an extension of
lambda-calculus has to verify is the Church-Rosser property"
bla bla bla

How is this even remotely relevant you fuck tard?
Did you just empty the ash tray that is in your head or what?

[Mild Shock]

Now I feel licenced to spam your thread here,
as long as I wish, as a retailation. This wasn't my plan
for 2024, but its all your own fault Rossy Boy.

Ross podcasts talks about mathematics, physics, science, logic, philosophy
https://groups.google.com/g/sci.math/c/N1YgkTqERJc

This is just this law and you don't deserve otherwise:

"To every action, there is always opposed an equal reaction;
or, the mutual actions of two bodies upon each other are
always equal, and directed to contrary parts."
https://en.wikipedia.org/wiki/Newton%27s_laws_of_motion#Newton's_third_law

Cry as much as you want. Its the consequences of your own actions.

Post by Mild Shock

Post by Ross Finlayson
"The most important property that an extension of
lambda-calculus has to verify is the Church-Rosser property"
bla bla bla

How is this even remotely relevant you fuck tard?
Did you just empty the ash tray that is in your head or what?

[Mild Shock]

"Archimedes Plutonium and Rossy Boy should be thrown in jail
for their willful criminal behavior. The criminals Archimedes
Plutonium and Rossy Boy all the times posts people
name lists together with hate speach about these people.

It is highly likely Archimedes Plutonium and Rossy Boy are
psychos. Archimedes Plutonium and Rossy Boy belong in prison
not on usenet for their mind is complete hate hate hate.
Put these creeps in jail and throw away the keys."

<as usual Idiotic spamming>

[Mild Shock]

Ernst Specker was very creative. Did he create
the word “Infuturabilien”? It seems so:

“In a certain sense the scholastic speculations
about the “Infuturabilien” [this term invented by
Specker is to be translated as something like
‘future contingencies’] also belong here, that is,
the question whether the omniscience of God
also extends to events that would have occurred
in case something would have happened that
did not happen. (cf. e.g. [3], Vol. 3, p. 363.)”
https://ar5iv.labs.arxiv.org/html/1712.06448

I guess he was just once again fooling around.
But the above arxiv link is interesting,
since one finds his famous riddle, that he

used in class to motivate young students,
not behind a paywall, but as a HTML:

The “Assyrian prophet” parable
https://ar5iv.labs.arxiv.org/html/1712.06448

Post by Mild Shock

Post by Ross Finlayson
I suppose you can rank old Mostowski Collapse

I don't use this nick name anymore, after somebody
asked me whether this refers to wave function collapse .
https://en.wikipedia.org/wiki/Wave_function_collapse
https://en.wikipedia.org/wiki/Mostowski_collapse_lemma
P.S.: But later I was reading a little bit about
wave function collapse and at the same time generative
https://scribblediffusion.com/
Guess whats behind it? But recently wave function collapse
is hunting me again. What is behind all this quantum crypto-
graphy? How about lattice based cryptography?
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

[Ross Finlayson]

Post by Mild Shock
Ernst Specker was very creative. Did he create
“In a certain sense the scholastic speculations
about the “Infuturabilien” [this term invented by
Specker is to be translated as something like
‘future contingencies’] also belong here, that is,
the question whether the omniscience of God
also extends to events that would have occurred
in case something would have happened that
did not happen. (cf. e.g. [3], Vol. 3, p. 363.)”
https://ar5iv.labs.arxiv.org/html/1712.06448
I guess he was just once again fooling around.
But the above arxiv link is interesting,
since one finds his famous riddle, that he
used in class to motivate young students,
The “Assyrian prophet” parable
https://ar5iv.labs.arxiv.org/html/1712.06448

Post by Mild Shock

Post by Ross Finlayson
I suppose you can rank old Mostowski Collapse

I don't use this nick name anymore, after somebody
asked me whether this refers to wave function collapse .
https://en.wikipedia.org/wiki/Wave_function_collapse
https://en.wikipedia.org/wiki/Mostowski_collapse_lemma
P.S.: But later I was reading a little bit about
wave function collapse and at the same time generative
https://scribblediffusion.com/
Guess whats behind it? But recently wave function collapse
is hunting me again. What is behind all this quantum crypto-
graphy? How about lattice based cryptography?
https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

Why do you call that Specker's a theorem when it isn't true? "Conjecture" is the usual word.

Another name for 'mimicry' is 'apery', you drunk.

Did I do that?