Journal article · 2026 · Open access
Using Bars to Push the Limits of Computability
Journal of the ACM · Published 26 October 2026 · DOI 10.1145/3839226
In brief
“Using Bars to Push the Limits of Computability” is a 2026 journal article by Mark Bickford and 3 co-authors, published in Journal of the ACM. OpenAlex counts 0 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of the ACM.
- Citations
- 0
- References
- 45
- Authors
- 4
Abstract
This paper introduces Brouwerian Type Theory ( \(( {BTT}) \) ), an extension of Constructive Type Theory incorporating Brouwer’s notion of computability to move beyond the Church-Turing paradigm. \( {BTT} \) achieves this by internalizing the notion of choice sequences—dynamic constructs with an evolving temporal nature central to intuitionistic mathematics. To support these constructs, which evolve over time through non-lawlike decisions, in a type system, \( {BTT} \) leverages the concept of bars, inspired by Kripke-style and Beth-style possible-world semantics, which enable structured handling of the temporal progression inherent in choice sequences. This ensures structured handling of evolving states while maintaining type-theoretic properties like transitivity and symmetry, alongside possible-world properties such as monotonicity and locality. The paper examines two concrete types of bars: Beth bars, which require constructing a complete bar to validate types, and open bars, which simplify validity by requiring only local extensions. While the former captures a purely constructive interpretation, the latter is shown to be compatible with classical reasoning, highlighting how varying bar interpretations in \( {BTT} \) affect compatibility with classical reasoning. Finally, the paper demonstrates the robustness of \( {BTT} \) for internalizing choice sequences by validating their core theory.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Bickford, M., Cohen, L., Constable, R. L., & Rahli, V. (2026). Using Bars to Push the Limits of Computability. Journal of the ACM. https://doi.org/10.1145/3839226
MLA 9
Bickford, Mark, et al. “Using Bars to Push the Limits of Computability.” Journal of the ACM, 2026. https://doi.org/10.1145/3839226.
Chicago
Bickford, Mark, Liron Cohen, Robert L. Constable, and Vincent Rahli. 2026. “Using Bars to Push the Limits of Computability.” Journal of the ACM. https://doi.org/10.1145/3839226.
Harvard
Bickford, M. et al. (2026) ‘Using Bars to Push the Limits of Computability’, Journal of the ACM. doi:10.1145/3839226.
IEEE
M. Bickford, L. Cohen, R. L. Constable, and V. Rahli, “Using Bars to Push the Limits of Computability,” Journal of the ACM, 2026, doi: 10.1145/3839226.
BibTeX
@article{bickford2026using,
title = {{Using Bars to Push the Limits of Computability}},
author = {Bickford, Mark and Cohen, Liron and Constable, Robert L. and Rahli, Vincent},
journal = {Journal of the ACM},
year = {2026},
doi = {10.1145/3839226},
url = {https://doi.org/10.1145/3839226}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- constructive type theory
- choice sequences
- bars
- intuitionistic mathematics
- Kripke semantics
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Bickford, M., Cohen, L., Constable, R. L., & Rahli, V. (2026). Using Bars to Push the Limits of Computability. Journal of the ACM. https://doi.org/10.1145/3839226
How many times has this paper been cited?
0 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Journal of the ACM: sign in and open the PDF from this page.
Who wrote this paper?
Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli.
What is the DOI of this paper?
10.1145/3839226, permanently at https://doi.org/10.1145/3839226. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.