Thread replies: 9
Thread images: 1
Thread images: 1
Victor
P is less than NP for any alphabet 2016-11-18 06:32:39 Post No. 8480980
[Report] Image search: [Google]
P is less than NP for any alphabet 2016-11-18 06:32:39 Post No. 8480980
[Report] Image search: [Google]
P is roughly A^A*
and NP is roughly A•A
This essentially proves you can get to two items faster on a computer in, in at least one instance, than to one. I.e. "Modern" Walmart computers
According to the problem statement of the question by Clay Mathematics Institute.
If you do it with R, Z, and N
You get roughly
P:NP:10:39 in number of infinities
>>
>>8480980
Before this post:
[X] Not thinking
[ ] Thinking
After this post:
[ ] Not Thinking
[X] Thinking
>>
>>8480985
Thanks. I'm making progress in my research.
>>
>>8480980
this isn't even wrong it's just the horrible
>>
>>8480995
What's horrible about it? You can only count collections of infinities in this problem.
>>
>>8481004
No one has actually provided an actual counterargument ever. So shut the fuck up bitch.
>>
>>8481012
you have to provide a coherent argument to expect counterarguments
state one clear proposition, your assumptions, and show the logic used to prove it
or just fuck off and kill yourself
>>
>>8481020
Bump only an actual retard can't see the intuition in the OP
>>
>>8481044
Don't make fun of Victor, he's schizophrenic.
Thread posts: 9
Thread images: 1
Thread images: 1