ALGORITHMIC PROPERTIES OF ROGERS SEMILATTICES

Simple item page
dc.contributor.authorTleuliyeva, Zhansaya
dc.date.accessioned2024-06-07T05:56:21Z
dc.date.available2024-06-07T05:56:21Z
dc.date.issued2024-04-25
dc.description.abstractThe thesis uses various approaches to explore the algorithmic complexity of families of subsets of natural numbers. One of these approaches involves investigating upper semilattices of computable numberings of a given family and their complexity in different hierarchies. These semilattices, known as Rogers semilattices, can help distinguish different structural properties of families of partial computable functions and computably enumerable sets. As a result, by using Rogers semilattices of computable numberings, we can measure the algorithmic complexity of the corresponding family.en_US
dc.identifier.citationTleuliyeva, Zh. (2024). Algorithmic properties of Rogers Semilattices. Nazarbayev University School of Sciences and Humanitiesen_US
dc.identifier.urihttp://nur.nu.edu.kz/handle/123456789/7769
dc.language.isoenen_US
dc.publisherNazarbayev University School of Sciences and Humanitiesen_US
dc.subjectType of access: Open accessen_US
dc.titleALGORITHMIC PROPERTIES OF ROGERS SEMILATTICESen_US
dc.typePhD thesisen_US
workflow.import.sourcescience

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
PhD_Thesis_Zhansaya-Tleuliyeva.pdf
Size:
820.66 KB
Format:
Adobe Portable Document Format
Description:
thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
6.28 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

01. PhD Thesis