Intuitionist Maths might help reconcile quantum physics and relativity

For the record, @version had a good phantom post about how Mr. Tea would make a good Nazi. I was trying to post that Waldo gimp image, but alas the antecedent post has vanished.


Well-known member
What I said was that Biscuits is more right wing, but Tea's more convincing as an SS officer. I can just picture it more vividly.
What qualities make someone a good Nazi? And is that better or worse than being a bad Nazi?
Well here, by “good nazi” I really mean an effective nazi, rather than an altruistically defective Nazi.

Mr. Tea would make an effective Nazi, according to Version.


Tight but Polite
Of @Mr. Tea and @mixed_biscuits , who is Enzian and who is Weissman?
I honestly just think of MB as someone running a denial-of-service attack on Tea at this point. It's a classic pattern, being executed really well - keep spamming requests, basically ignore the responses, maximize the amount of time that the target has to put into dealing with them while minimizing the amount of effort that you need to put into producing more of them. "look, here's a link that I found!" "You can't just say it's rubbish, you need to give me a handcrafted point-by-point rebuttal!" "I don't like that rebuttal, do it again!" "Look, here's a link that I found!"

I'm not sure what the motivation is, though. Is Tea doing anything so important that shadowy forces might be trying to keep him too tied up to do it?

Mr. Tea

"can't soundclash" according to a VERY HARD MAN
There was a clandestine committee at the Nuremberg trials, the Committee on Malapropistic Malpractice, that was after him for a while, but they eventually ceded out of sheer fatigue.
Yeah, I was hanging out in Buenos Aires with the other guys for a while, but Eichmann eventually said he couldn't take it any more and handed himself over to Mossad.

Mr. Tea

"can't soundclash" according to a VERY HARD MAN
Last thing I heard from him was some forlorn wail about "inhuman cruelty..."
@wektor I'm having ChatGPT (3.5 I think) explain quantum computing to me:

Can you explain which types of computational problems quantum computers are better at than classical computers?

Quantum computers are better suited than classical computers for solving certain types of computational problems. These problems include:

  1. Factorization: Quantum computers can efficiently factor large numbers into their prime factors. This has implications for cryptography, as many encryption algorithms rely on the difficulty of factoring large numbers.
  2. Search: Quantum computers can search large databases faster than classical computers using Grover's algorithm. This can have applications in fields such as data mining and optimization.
  3. Simulation: Quantum computers can simulate quantum systems more efficiently than classical computers using algorithms such as the quantum Monte Carlo method. This can have applications in fields such as material science and chemistry.
  4. Machine learning: Quantum computers can potentially accelerate machine learning algorithms by performing computations in parallel and processing large amounts of data more efficiently. However, this is an area of ongoing research and development.
It's worth noting that not all problems can be solved more efficiently on a quantum computer, and in fact, many problems that classical computers excel at may not benefit from quantum computing. Additionally, quantum computers are still in the early stages of development, and current quantum computers are still limited in their size and capabilities. Nonetheless, the potential of quantum computing to solve certain types of problems more efficiently than classical computers is an active area of research and development.
Regarding item number 2, can you create an example of a situation where quantum computing can more efficiently search a large database than a classical computer can?

Sure, let me give you an example.

Suppose you have a large database with N items, and you want to find a specific item within this database. A classical computer would need to check each item one by one, which would take O(N) time in the worst case.

In contrast, a quantum computer can use Grover's algorithm to search through the database in O(√N) time. This algorithm works by encoding the database into a quantum state, and then using a series of quantum operations to amplify the probability of finding the desired item.

The speedup of Grover's algorithm becomes more significant as the size of the database grows. For example, if you had a database with a billion items, a classical computer would need to check each item one by one, which could take hours or even days. In contrast, a quantum computer could potentially search the same database in just a few minutes using Grover's algorithm.

Note that this assumes an ideal quantum computer with perfect quantum gates and error correction. In reality, current quantum computers are still limited by noise and other sources of error, which can reduce the efficiency of quantum algorithms such as Grover's algorithm. Nonetheless, Grover's algorithm remains a powerful tool for searching large databases on a quantum computer.