Eliminating unbounded search in classical branches of computability theory - Conference attendances

Eliminating unbounded search in classical branches of computability theory Conference attendances

Language

Английский

Participant type

Пленарный

Conference

Международная конференция "МАЛЬЦЕВСКИЕ ЧТЕНИЯ"
14-18 Nov 2022 , Новосибирск

Authors

Bazhenov Nikolay Alekseyevich ¹ , Калимуллин И.Ш. ² , Мельников А.Г. ³

Affiliations

1	Sobolev Institute of Mathematics
2	Kazan Federal University
3	Victoria University of Wellington

Bazhenov N.A. , Калимуллин И.Ш. , Мельников А.Г.
Eliminating unbounded search in classical branches of computability theory
Международная конференция "МАЛЬЦЕВСКИЕ ЧТЕНИЯ" 14-18 Nov 2022