Computability theory and applications

In this thesis, we will look at how computability theory can be applied on classical mathematical analysis and general topology. We will specifically look at how to effectivize standard objects in analysis and topology such as the reals, metric spaces and topological spaces by building corresponding...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Khoo, Kai Jun
مؤلفون آخرون: Ng Keng Meng
التنسيق: Final Year Project
اللغة:English
منشور في: Nanyang Technological University 2023
الموضوعات:
الوصول للمادة أونلاين:https://hdl.handle.net/10356/166414
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
المؤسسة: Nanyang Technological University
اللغة: English
الوصف
الملخص:In this thesis, we will look at how computability theory can be applied on classical mathematical analysis and general topology. We will specifically look at how to effectivize standard objects in analysis and topology such as the reals, metric spaces and topological spaces by building corresponding computable representations. We also show a new sufficient result for computable categoricity. Lastly, we effectivize the topological concept of compactness and show an effective version of the Stone representation theorem for Boolean algebras.