Proof of Achievement of the First Artificial General Intelligence (AGI)

Proof of Achievement of the First Artificial General Intelligence (AGI)
zenodo.org

Over the years researchers have claimed to create cold fusion, room temperature superconductors, and other fantastic things.

Extraordinary claims require real evidence and reproducible reaults.

The paper makes a mountain out of a molehill but could achieve the AGI we all want should no one else get there first.

(Cycorp alum)

As a threshold comment, every element of this (in theory and in practice) is entirely reproducible via the materials already provided in this paper and in the peer-reviewed literature, including AAAI, ICDM, KDD, Neural Networks, IEEE Symposium Series on Computational Intelligence, Cognitive Science, IEEE HumTech, and other venues.

There is a wealth of examples in those papers that you can compute and verify on your own. In the proof paper, I've added cites every time a particular area of performance is discussed. My recommendation would be to find those areas that seem most confounding to you and then read the corresponding papers in order to see how we handle them.

Going back to the proof paper, that paper provides a standalone proof of AGI achievement, as per its title. You can verify this proof entirely with your own resources.

The structure of the proof is simple; starting with the literature on intelligence as a base, we first derive the properties that any AGI must/must not have and then show that our formalism indeed holds all of those properties (and does not have properties that it's not allowed to have). Because the necessary properties have been met, AGI has been achieved. People often want to add a 'real-world realization' requirement as part of the concept of achievement, which is not required, but this too is met via the examples given in the papers and many years of real-world use of this technology within the US Government.

The structure of the proof is very simple, and is fairly obviously valid and sound, so if the premises are true then the conclusion (successful AGI achievement) must also be true.

Given this, you really only have three possible paths: show that the structure of my proof is not valid and/or sound, show that my derivation of the AGI properties is somehow incorrect, or show that my computation formalism doesn't have the properties just stated. If you can't do any of that, then I've met my burden and you have no rational basis to reject my conclusion.

The only way to prove AGI is by showing that the right properties hold of a system at its top level. Generality means a guarantee that the system can handle any future problem seen or unseen, but we can't generalize from examples; showing it working for 10 cases doesn't tell you if it will work for the 11th.

Given that we prove our system 'for all n', the proof that we provide in this paper is in fact far stronger than even what you've asked for here. We employ the strongest possible proof mechanism available.

As for formal descriptions and applications, these are extensively provided in the papers noted in an earlier comment (cited in the proof paper). See especially "Semantically-based priors and nuanced knowledge core for Big Data, Social AI, and language understanding" for a mathematical treatment of waste entropy and how and why atoms work at a fundamental level.