- The ultimate thread pool - 4 Updates
- ℙ≠ℕℙ proof - 1 Update
| Bonita Montero <Bonita.Montero@gmail.com>: Feb 04 05:58AM +0100 Am 03.02.2024 um 21:05 schrieb Chris M. Thomasson: > Hummm... You threw me for a loop here... What exactly do you mean? Show > me a condensed example. Those warnings are there for a reason... You > really need to model it in a race detector. Relacy is a fun one. The code doesn't need any race detector, the synchronization part is trivial. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Feb 03 09:30PM -0800 On 2/3/2024 8:58 PM, Bonita Montero wrote: >> You really need to model it in a race detector. Relacy is a fun one. > The code doesn't need any race detector, the synchronization part is > trivial. What happens if you turn off all of those very important warnings? |
| Bonita Montero <Bonita.Montero@gmail.com>: Feb 04 07:41AM +0100 Am 04.02.2024 um 06:30 schrieb Chris M. Thomasson: >> The code doesn't need any race detector, the synchronization part is >> trivial. > What happens if you turn off all of those very important warnings? What a question ... I get incorrect warnings while compiling. |
| "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>: Feb 04 01:59PM -0800 On 2/3/2024 10:41 PM, Bonita Montero wrote: >> What happens if you turn off all of those very important warnings? > What a question ... > I get incorrect warnings while compiling. Why are they incorrect, according to you? Boil it down to a simple example where these warnings are incorrect. That way I can reproduce it on my side. |
| wij <wyniijj5@gmail.com>: Feb 04 11:11AM +0800 This file is intended a proof that ℙ≠ℕℙ. https://sourceforge.net/projects/cscall/files/MisFiles/PNP-proof.txt/download ------------- ANPC::= Set of decision problems that additional information c must be provided to compute the problem in P-time (including processing the information c (certificate)). Since the information c can be generated in O(2^N) time, the upper bound of ANPC is O(2^N) (checking c is in P-time). Corollary: ANPC ⊆ ℕℙ (from ℕℙ definition: "... ℕℙ is the set of decision problems verifiable in polynomial time by a deterministic Turing machine. https://en.wikipedia.org/wiki/NP_(complexity)") If we try to prove or show that an ANPC problem can be solved in P- time, we would also be trying to prove/show that the requirement of the additional information c is not necessary. Thus, such a proof will just prove itself not a valid proof, IOW, ANPC==P is unprovable. Conclusion: ANPC is not P-time provable/solvable (implied by ANPC definition) Corollary: ℕℙ!=ℙ (ANPC ⊆ ℕℙ AND ANPC!=ℙ) QED. ------------ |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment