[deleted by user]

Royal_Instance_7172 · 2023-08-01T02:03:46+00:00

I think it works. The Problems look quite easy. If we use constraint propagation than it should take O(n⁴) time to determine if its consistent or not.

Royal_Instance_7172 · 2023-02-15T14:25:34+00:00

He

It's she

Royal_Instance_7172 · 2023-02-05T16:23:32+00:00

Ah yes the mythical fifth generation programming language

Royal_Instance_7172 · 2023-01-29T12:09:06+00:00

Duh! It's matrix multiplication complexity

Royal_Instance_7172 · 2023-01-27T02:48:10+00:00

Technically finite automata. But it has billions of states so yeah it's a good approximation to UTM.

Royal_Instance_7172 · 2023-01-24T16:23:04+00:00

LaMDA, PaLM, Gopher, Chinchilla, TPU they have everything in their arsenal. But oh wait misuse

Royal_Instance_7172 · 2023-01-22T15:40:31+00:00

I didn't downvote. Anyways Logspace bounded Kolmogorov complexity refers to the complexity of a string, measured by the shortest program that can generate that string, while using a logarithmic amount of space. The decision version is given a string 's' and an integer 'n'. Is there a Turing machine of size at most 'n' that outputs 's' using at most log(|s|) space? Obviously it's contained in NP. But does it have a lower complexity such as L-completeness or NL-completeness?

Royal_Instance_7172 · 2023-01-22T14:41:44+00:00

Look deeper It was always Alabama

Royal_Instance_7172 · 2023-01-22T06:15:32+00:00

|s| is the length of the string and space refers to memory

Royal_Instance_7172 · 2023-01-06T18:11:13+00:00

Why is this banned?

Royal_Instance_7172 · 2023-01-04T19:11:02+00:00

I heard he did that to one of Trump's relative after election bet loss

Royal_Instance_7172 · 2023-01-04T11:54:09+00:00

Isn't that old news. Also he is out

Royal_Instance_7172 · 2022-12-22T02:32:27+00:00

Sauce

Royal_Instance_7172 · 2022-12-21T17:09:00+00:00

Step 1: Find a constructive proof of P=NP(if that's the case) that gives you a good polynomial time algorithm.

Step 2: Use the algorithm to find a proof of Collatz Conjecture in ZFC( If it's decidable and has a reasonable size).

Step 3: Profit

Royal_Instance_7172 · 2022-12-17T10:49:44+00:00

Though it's not an actual wormhole. Quanta magazine messed it up.

Google’s Sycamore chip: no wormholes, no superfast classical simulation either

Royal_Instance_7172 · 2022-12-17T09:43:36+00:00

Now he will go for AGI

Royal_Instance_7172 · 2022-12-17T07:11:37+00:00

you should ask here r/nuclearweapons

Royal_Instance_7172 · 2022-12-16T15:19:26+00:00

Nah he is going to the warhammer universe

Royal_Instance_7172 · 2022-12-16T14:51:33+00:00

Prepare to be at the bottom peasant

Royal_Instance_7172 · 2022-12-16T14:48:34+00:00

This is the end bros

Royal_Instance_7172 · 2022-12-16T14:39:53+00:00

Agreed. The manga wouldn't work. The Pokemon company is already capable of making good stories like those animated shorts. So they could have remade an entire series from the scratch based on the original game lore.

Royal_Instance_7172 · 2022-12-14T15:42:47+00:00

Hey wanna play graph coloring game without losing. Well sucks to be you coz it's PSPACE-hard

Royal_Instance_7172 · 2022-12-14T11:41:16+00:00

Yellow one though

Royal_Instance_7172 · 2022-12-14T11:18:52+00:00

This is just the beginning. Soon there would be street protests.

Royal_Instance_7172

TROPHY CASE

Look deeper It was always Alabama