Trevor Nestor
CV
Research Blog
Portfolio
Publications
About Me
Contact
More
2025
T. Nestor "Theoretical Approaches to Solving the Shortest Vector Problem in NP-Hard Lattice-Based Cryptography with Post-SUSY Theories of Quantum Gravity in Polynomial Time by Orch-Or" (2025)
​
​View of Theoretical Approaches to Solving the Shortest Vector Problem in NP-Hard Lattice-Based Cryptography with Post-SUSY Theories of Quantum Gravity in Polynomial Time by Orch-Or
T. Nestor "Solving NP-hard Problems - A Journey Through the Hardest Problems in the Universe"
Nestor, Trevor, AI Models Are Not Conscious and Are Massively Inefficient, Causing Complexity and Scalability Bottlenecks to Artificial General Superintelligence Risking Technological Singularity and Loss of Societal Dynamism or Institutional Collapse and Renewal (June 16, 2025). Available at SSRN: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5299044
