Computability Beyond Church-Turing via Choice Sequences

DOI10.1145/3209108.3209200zbMath1452.03133OpenAlexW2798735574WikidataQ130953758 ScholiaQ130953758MaRDI QIDQ5145297

Mark Bickford, Vincent Rahli, Liron Cohen, Robert L. Constable

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/71146432/Computability_Beyond.pdf

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Metamathematics of constructive systems (03F50) Other degrees and reducibilities in computability and recursion theory (03D30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Type theory (03B38)

Related Items (3)

The effects of effects on constructivism ⋮ Higher order functions and Brouwer’s thesis ⋮ Formally computing with the non-computable

Uses Software

• Nuprl

This page was built for publication: Computability Beyond Church-Turing via Choice Sequences