[1] David Chiang, Peter Cholak, and Anand Pillay. Tighter bounds on the expressivity of transformer encoders. In Proceedings of the 40th International Conference on Machine Learning, ICML'23. JMLR.org, 2023.
[2] David Chiang and Peter Cholak. Overcoming a theoretical limitation of self-attention. In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 7654--7664, Dublin, Ireland, 2022. Association for Computational Linguistics. arXiv:https://arxiv.org/abs/2107.01299. [ DOI | http ]
[3] Peter Cholak, Rod Downey, W. Gasarch, E. Kinber, M. Kummer, S. Kurtz, and T. Slaman. Degrees of inferability. In Proceedings of the Fifth Annual Conference on Computational Learning Theory, pages 180--192. ACM, 1992.
[4] P. Cholak. The computably enumerable sets: Recent results and future directions. In Petr Hájek, Luis Valdés-Villanueva, and Dag Westerståhl, editors, Logic, Methodology and Philosophy of Science: Proceedings of the 12th International Congress of Logic, Methodology and Philosophy of Science, pages 91--105. King's College Publications, 2005. Pdf.
[5] Peter Cholak, Damir Dzhafarov, Jeff Hirst, and Theodore A. Slaman. Generics for computable Mathias forcing. In S. Barry Cooper, Anuj Dawar, and Benedikt Löwe, editors, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings., volume 7318 of Lecture Notes in Computer Science, pages 129--138. Springer, 2012. This is an extended version of the prepublication "On Mathias generic sets". Pdf.

This file was generated by bibtex2html 1.99.