Comments for Gödel's Lost Letter and P=NP

Comment on Rabin has just passed away by Adam

Adam — Wed, 22 Apr 2026 17:56:41 +0000

Rabin was a great lecturer. Maybe made a archive of his video recorded lectures available. His course notes and talks should also be preserved. Maybe ACM can make a archive of all his papers, slides and recorded talks.

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Fri, 04 Apr 2025 11:21:59 +0000

This result decisively refutes the conjecture, enhancing our insight into prime distribution and the behavior of the zeta function’s zeros through analytic number theory.

https://www.preprints.org/manuscript/202504.0246/v1

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Thu, 27 Mar 2025 06:23:11 +0000

I proposed an approximate solution to the NP-Hard Minimum Dominating Set Problem (MDS), which has shown promising experimental results. The experimental findings demonstrate a 2-approximation ratio for this problem, providing compelling evidence that P=NP.

https://dev.to/frank_vega_987689489099bf/a-2-approximation-algorithm-for-dominating-sets-1aga

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Fri, 21 Mar 2025 04:01:20 +0000

This algorithm resolves the NP-Hard Minimum Dominating Set Problem in quadratic time, suggesting P = NP and delivering practical benefits across diverse fields, including artificial intelligence, medicine, and impact in the industries.

https://dev.to/frank_vega_987689489099bf/polynomial-time-algorithm-for-mds-p-np-1ln6

Comment on Biblical Codes by Wayne Shanks

Wayne Shanks — Fri, 21 Mar 2025 02:24:41 +0000

What encoded clues are we likely to find in the text of Ayn Rand, or Herman Melville, or even the Dictionary. Codes in the Bible are only interesting if they don’t appear in every other work…. or maybe they are still interesting… I cant tell

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Wed, 12 Mar 2025 16:43:10 +0000

Leading AI systems have reportedly confirmed the validity of my P=NP proof and provided a detailed analysis of its theoretical foundations:

https://www.linkedin.com/posts/frank-vega-delgado_vertex-cover-problem-new-insights-critique-activity-7305610255227404289-y9Kq?utm_source=share&utm_medium=member_desktop&rcm=ACoAAA3ojloBlOVpZezqUMtGhzfTLS7gJSDjw14

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Fri, 07 Mar 2025 04:00:28 +0000

The Dominating Set Problem is a fundamental problem in graph theory and combinatorial optimization, with applications in network design, social network analysis, and resource allocation. The algorithm employs an efficient algorithm to compute an approximate Dominating Set for an undirected graph using the NetworkX library. A Dominating Set is a subset of vertices such that every vertex in the graph is either in the subset or adjacent to at least one vertex in the subset. Since finding the exact minimum Dominating Set is NP-hard, the algorithm employs a 8-approximation approach based on a minimum maximal matching. The algorithm first validates the input graph to ensure it is undirected and non-empty. Isolated nodes are removed as they cannot contribute to a connected Dominating Set. The core of the algorithm uses NetworkX’s “min_maximal_matching” function. The resulting matching is converted into a Dominating Set by including all nodes in the matched edges. Next, we iteratively remove redundant vertices from the initial candidate dominating set. This approach guarantees polynomial runtime while maintaining reasonable approximation quality. This work contributes to the growing body of research on approximation algorithms for NP-hard problems, providing strong evidence that P = NP.

https://pypi.org/project/baldor/

Comment on Limits On Matrix Multiplication by Frank Vega

Frank Vega — Mon, 03 Mar 2025 03:38:39 +0000

A linear-time solution for the Triangle Finding Problem enhances efficiency in sparse graph analysis, enabling faster detection of triangles in large networks, improved calculation of clustering coefficients, and more efficient community detection. This advancement benefits diverse fields such as social network analysis, where understanding user interactions is crucial, bioinformatics for studying protein interaction networks, and recommendation systems that infer user preferences from interaction graphs. Overall, it accelerates the study of crucial graph properties, making it practical for large-scale networks.

https://pypi.org/project/aegypti/

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Fri, 07 Feb 2025 19:02:30 +0000

Disproving the Unique Games Conjecture! This work provides a strong evidence that the Unique Games Conjecture does not hold. This is very positive approach since if the conjecture would be true, then this would imply the hardness of approximating solutions to many other important problems in various fields of mathematics, including graph theory, optimization, and even aspects of geometry. BTW, I removed the flawed extension of this result for proving P=NP.

https://pypi.org/project/varela/

Comment on P=NP and Bitcoin by Frank Vega

Frank Vega — Thu, 06 Feb 2025 01:56:21 +0000

Discover a new 7/5-Approximation for MVC That’s Redefining the Boundaries of Computer Science!

Why This Matters?

1. Challenges P = NP,
2. Defies the Unique Games Conjecture,
3. Real-World Impact.

Distributed via PyPI:

https://pypi.org/project/varela/