Also, the AGI can generate a long valid proof but it may not be for the question you have asked, since the assumption is that the problems described in natural language and its the AGI’s job to understand and convert it to formal language and then prove it
I think instead of recursively asking for higher level proof it should be a machine-checkable regarding the correctness of the AGI itself?
Also, the AGI can generate a long valid proof but it may not be for the question you have asked, since the assumption is that the problems described in natural language and its the AGI’s job to understand and convert it to formal language and then prove it
I think instead of recursively asking for higher level proof it should be a machine-checkable regarding the correctness of the AGI itself?