reality does not exist
>>546605055P=NP agreed. GRH confirms.
>>546605055So trannies are women?
>>546605055>If we assume a self-containing data set in 8 dimensions and mulitpe time axis, then clearly P=NP.Mental wankery of the highest order.
Problem = No ProblemNothing ever happens
>>546605055Please elaborate.
>>546605336>Is it easy to calculate the thing if we do it properly?
I hate reality, it makes the life unbearable.
>>546605191>penis equals no penis
Even a simulation is real as it runs on real underlying substrate
>>546605336Some problems are difficult to solve, but if you have a solution it's easy to check if that specific solution is correct (compare how easy it is to check if someone's sudoku is correct vs solving it yourself). If P=NP then every problem where you can verify any of its solutions easily must have an easy way to obtain the solution.
>>546605442LOL
>>5466050551=NN=1Ans: One NIGGER
I imagined all this earlier
>>546605529Except the one time pad
>>546605055NP = NWchecked
I love pineapple pen
>are two different things actually the same?No. Mathfaggots are just hunting grant money for a solution that doesn't exist.
>>546605665That is not true. You can test all possible pads if you know the solution and find the right one in P time easily with any P sorter.
>>546605336he's an idiot
>>546605665All decodings of a one time pad are equally likely, so it's a trivial solution case where every possible solution is correct from a mathematical standpoint, that is why the method is secure insofar as the physical protection of the pads is secure desu
>>546605882Precisely. The equation "P=NP" is a violation of the logical Law of Identity and thus CANNOT exist. They've basically convinced their sponsors that they can find evidence of unicorns and big foot.
>>546605055We all live a subjective substraction of any given event, who cares, we can still interact with reality enough
>>546605529>it's easy to check if that specific solution is correctthat's not what p=np is about, retard
>>546606198>The equation "P=NP" is a violation of the logical Law of Identity and thus CANNOT existprove it.
>>546606068The number of pads possible is exponential wrt the message length
>>546605055>>546606228it has not been mentioned in this thread, so far, i thinkt. knower (i think)
>>546606287Of course. The Law of Identity is very simple: A = A. If A were to ever be equal to something that was not A, then it was never A to begin with. It is a logical contradiction to say that a rock could ever be anything other than a rock. Or perhaps more relevant to current events, it is impossible for a man to ever be anything other than a man, like for example a woman.The ontology, the nature or essence, of a thing, cannot change or it was never actually that thing.To suggest that P could ever equal not P is to deny the Law of Identity, and that's self-refuting, since math itself at it's core reliant on stable identity of numbers and meaning and truth and all sorts of other categories.I'll ask you simply: can the number "1" ever equal anything other than "1"?
>>546606287Would proving it could not be proven one way or another count? (not sure if that would be true though )
>>546606303but not the number of non-trivial zeros in the trace and theta lift functions. almost all possible messages are nonsense. transformers and large inference models can always be created in NP time to provide P time solutions. this will be true as long as we use binary logic instead of primary logic. all these problems are NP hard only because of binary not being fully dense on the complex number field to handle bullshit like divide by zero and halting problem.
>>546606687You can hallucinate messages out of randomness but that doesn't mean the measages were sent
What problems retards?This is some vague ass shit.Blow it out your ass nigger.
N = 1
>>546606790I'll play.N = 1 = G
>>546606773you are assuming the pads are sound. for example, in primary logic, all numbers are represented in factored state already. there is no problem then doing prime factorization in this computation system, it reduces to boolean problem. if we can do primes in boolean time, we can find such logic systems for all possible binary algorithims. you want to say factoring primes is NP when can be 1. the space of all possible llms is larger than the space of all possible pads by far. we will always find complex field trace and field lifts for all possible such systems.