G\"odel Incompleteness Theorem for PAC Learnable Theory
<|reference_start|>G\"odel Incompleteness Theorem for PAC Learnable Theory: Different from the view that information is objective reality, we adopts the idea that all information needs to be compiled by the interpreter before it can be observed. Then, the interpreter-based information theory with its complexity is given by formula. Through the relationship between complexity and PAC learnability, the general PAC learnability corresponding to general complexity is derived. Then we generalize the observation process to the formal system with functors, in which we give concrete proof of the generalized G\"odel incompleteness theorem. Finally, the Cantor set, the original G\"odel incompleteness theorem, the Turing halting problem and the EPR paradox are put into the same mathematical framework as the specific applications of the general G\"odel incompleteness theorem.<|reference_end|>
@article{ma2024g\"odel,
    title={G\"odel Incompleteness Theorem for PAC Learnable Theory},
    author={Zhifeng Ma, Tianyi Wu, Zhangang Han},
    journal={arXiv preprint arXiv:2408.10211},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.10211},
    primaryClass={cs.LO math.LO}
}