On computability and tractability for infinite sets
DOI10.1145/3209108.3209190zbMATH Open1452.03093OpenAlexW2798653279MaRDI QIDQ5145286FDOQ5145286
Szymon Toruńczyk, Mikołaj Bojańczyk
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: https://doi.org/10.1145/3209108.3209190
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (8)
- Title not available (Why is that?)
- ON THE COMPUTING POWER OF PROGRAMS WITH SETS
- Infinite computations and the generic finite
- Permutation groups with small orbit growth
- Reasoning about infinite computations
- Title not available (Why is that?)
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- The Complexity of Infinite Computations In Models of Set Theory
This page was built for publication: On computability and tractability for infinite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145286)
