Papers & Talks: Difference between revisions
Jump to navigation
Jump to search
(stub) |
No edit summary |
||
| Line 1: | Line 1: | ||
== Papers == | |||
Paper produced by The bbchallenge Collaboration: | |||
* '''Determination of the fifth Busy Beaver value.''' The bbchallenge Collaboration, J. Blanchard, Daniel Briggs, Konrad Deka, Nathan Fenner, Yannick Forster, Georgi Georgiev (Skelet), Matthew L. House, Rachel Hunter, Iijil, Maja Kądziołka, Pavel Kropitz, Shawn Ligocki, mxdys, Mateusz Naściszewski, savask, Tristan Stérin, Chris Xu, Jason Yuen, Théo Zimmermann. ''In preparation.'' [https://github.com/bbchallenge/bbchallenge-paper (github)] | |||
* '''Turing machines deciders, part I.''' The bbchallenge Collaboration, J. Blanchard, K. Deka, N. Fenner, T. Guilfoyle, Iijil, M. Kądziołka, P. Kropitz, S. Ligocki, P. Michel, M. Naściszewski, and T. Stérin. Apr. 2025. https://arxiv.org/abs/2504.20563 | |||
Paper produced by community members: | |||
* Stérin, T., Woods, D. (2024). Hardness of Busy Beaver Value BB(15). In: Kovács, L., Sokolova, A. (eds) Reachability Problems. RP 2024. Lecture Notes in Computer Science, vol 15050. Springer, Cham. https://doi.org/10.1007/978-3-031-72621-7_9 | * Stérin, T., Woods, D. (2024). Hardness of Busy Beaver Value BB(15). In: Kovács, L., Sokolova, A. (eds) Reachability Problems. RP 2024. Lecture Notes in Computer Science, vol 15050. Springer, Cham. https://doi.org/10.1007/978-3-031-72621-7_9 | ||
** Paper: [https://arxiv.org/abs/2107.12475 arxiv version] (first released in 2021), [https://link.springer.com/chapter/10.1007/978-3-031-72621-7_9 conference version] | ** Paper: [https://arxiv.org/abs/2107.12475 arxiv version] (first released in 2021), [https://link.springer.com/chapter/10.1007/978-3-031-72621-7_9 conference version] | ||
** Talk on September 25th 2024 at RP 2024 in Vienna: [https://drive.google.com/file/d/1gCoKCHvXGJeY7LvdQX9kN8u0ITdCKtJN/view?usp=sharing talk recording], [https://drive.google.com/file/d/1x3MRuKyh92XWlBHRawqDzxEdXIGSgsX_/view?usp=drive_link talk recording (compressed)], [https://docs.google.com/presentation/d/1rVEMr-AJM_kTzdI95xT2KLux4G24AoTBBCYQoPk8vS0/edit#slide=id.g2d359b31dea_0_2125 talk slides] | ** Talk on September 25th 2024 at RP 2024 in Vienna: [https://drive.google.com/file/d/1gCoKCHvXGJeY7LvdQX9kN8u0ITdCKtJN/view?usp=sharing talk recording], [https://drive.google.com/file/d/1x3MRuKyh92XWlBHRawqDzxEdXIGSgsX_/view?usp=drive_link talk recording (compressed)], [https://docs.google.com/presentation/d/1rVEMr-AJM_kTzdI95xT2KLux4G24AoTBBCYQoPk8vS0/edit#slide=id.g2d359b31dea_0_2125 talk slides] | ||
* Xu, C. (2024). Skelet #17 and the fifth Busy Beaver number. [https://arxiv.org/abs/2407.02426 Arxiv preprint] | * Xu, C. (2024). Skelet #17 and the fifth Busy Beaver number. [https://arxiv.org/abs/2407.02426 Arxiv preprint] | ||
== Talks == | |||
* ''To come: '''Le cinquième nombre Busy Beaver.''''' Talk by Tristan Stérin at the seminar of Prof. Timothy Gowers [https://www.college-de-france.fr/fr/chaire/timothy-gowers-combinatoire-chaire-statutaire/ College de France's lectures] , October 27th 2025. | |||
* '''Coq proof of the fifth Busy Beaver value.''' Talk given by Tristan Stérin at '''[https://msp.cis.strath.ac.uk/types2025/cfp.html Types 2025],''' Glasgow, Scotland, June 9th 2025. [https://docs.google.com/presentation/d/1koofTIAOdk-DsKH6bnLi_jPeHG3-9vz2EcS_N5PsU-0/edit (slides)] [https://bbchallenge.org/types2025 (links)] | |||
* '''Formal verification of the 5th Busy Beaver value.''' Talk given by Maja Kądziołka and Tristan Stérin at Cambridge's seminar "[https://talks.cam.ac.uk/show/index/164015 Formalisation of mathematics with interactive theorem provers]", March 13th 2025. [https://www.youtube.com/watch?v=5X6YVEnbLZU (recording)] [https://docs.google.com/presentation/d/1enqHCmXNYubhZyHmaj1qaYciY0bJtSJasc8gqwMLZ7c/edit?slide=id.g319e2b7dbee_0_3#slide=id.g319e2b7dbee_0_3 (slides, part 1)] [https://sakamoto.pl/~mei/bbslides/bbslides.html (interactive slides, part 2)] | |||
Revision as of 11:34, 31 August 2025
Papers
Paper produced by The bbchallenge Collaboration:
- Determination of the fifth Busy Beaver value. The bbchallenge Collaboration, J. Blanchard, Daniel Briggs, Konrad Deka, Nathan Fenner, Yannick Forster, Georgi Georgiev (Skelet), Matthew L. House, Rachel Hunter, Iijil, Maja Kądziołka, Pavel Kropitz, Shawn Ligocki, mxdys, Mateusz Naściszewski, savask, Tristan Stérin, Chris Xu, Jason Yuen, Théo Zimmermann. In preparation. (github)
- Turing machines deciders, part I. The bbchallenge Collaboration, J. Blanchard, K. Deka, N. Fenner, T. Guilfoyle, Iijil, M. Kądziołka, P. Kropitz, S. Ligocki, P. Michel, M. Naściszewski, and T. Stérin. Apr. 2025. https://arxiv.org/abs/2504.20563
Paper produced by community members:
- Stérin, T., Woods, D. (2024). Hardness of Busy Beaver Value BB(15). In: Kovács, L., Sokolova, A. (eds) Reachability Problems. RP 2024. Lecture Notes in Computer Science, vol 15050. Springer, Cham. https://doi.org/10.1007/978-3-031-72621-7_9
- Paper: arxiv version (first released in 2021), conference version
- Talk on September 25th 2024 at RP 2024 in Vienna: talk recording, talk recording (compressed), talk slides
- Xu, C. (2024). Skelet #17 and the fifth Busy Beaver number. Arxiv preprint
Talks
- To come: Le cinquième nombre Busy Beaver. Talk by Tristan Stérin at the seminar of Prof. Timothy Gowers College de France's lectures , October 27th 2025.
- Coq proof of the fifth Busy Beaver value. Talk given by Tristan Stérin at Types 2025, Glasgow, Scotland, June 9th 2025. (slides) (links)
- Formal verification of the 5th Busy Beaver value. Talk given by Maja Kądziołka and Tristan Stérin at Cambridge's seminar "Formalisation of mathematics with interactive theorem provers", March 13th 2025. (recording) (slides, part 1) (interactive slides, part 2)