Computability theory. Abstracts from the workshop held February 5--11, 2012.

DOI10.4171/OWR/2012/08zbMath1349.00035OpenAlexW4248622102MaRDI QIDQ343320

No author found.

Publication date: 27 November 2016

Published in: Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/owr/2012/08

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Computability and recursion theory (03Dxx)

Cites Work

• Generic-case complexity, decision problems in group theory, and random walks.
• Generic computability, Turing degrees, and asymptotic density
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS

This page was built for publication: Computability theory. Abstracts from the workshop held February 5--11, 2012.