user1138

4 ms·

1.
by user1138 8mo ago
You're correct on the citations though that will probably be very easy as we have many people claiming exactly that. As to your second point, yes, and the safety claims being made are not restricted to those decidable subsets. The mome
2.
by user1138 8mo ago
Here's your citation — ARIA's Safeguarded AI program, £59M in UK government funding, explicitly claiming mathematical safety guarantees through restricted verifiable models — total languages by another name. The claim exists. It h
3.
by user1138 8mo ago
While I do have a formal citations there is this https://venturebeat.com/ai/lean4-how-the-theorem-prover-work...
4.
Total languages do not escape the halting problem – a trinary proof sketch(github.com)
4 points by user1138 8mo ago|6 comments
5.
by user1138 8mo ago
The formal verification and AI safety literature frequently cite total languages as a solution to the halting problem. This paper argues that this claim relies on a binary reduction of a trinary problem. While total languages provide an exi
6.
I Measured the Landauer Limit in Blood: A Reality Check for 'Elegant Algorithms'(adversarialbaseline.substack.com)
1 points by user1138 8mo ago|0 comments
7.
The methodology behind the LLM contamination paper getting sustained cloning(adversarialbaseline.substack.com)
1 points by user1138 8mo ago|0 comments
8.
Self-Replicating LLM Artifacts and Accidental Supply-Chain Contamination(github.com)
2 points by user1138 8mo ago|1 comments
9.
by user1138 8mo ago
In 2011, while working in a strip club and covering a drug addiction, I argued that “DNA was too informationally dense and informationally complex” (exact words) to permit easy genetic engineering, before I had the math to formalize it. Phy