COMPUTABILITY OF ALGEBRAIC STRUCTURES

dc.contributor.authorTursynov, Adil
dc.date.accessioned2024-06-07T10:13:59Z
dc.date.available2024-06-07T10:13:59Z
dc.date.issued2024-04-26
dc.description.abstractIn the modern world, research areas are extremely progressive. One of them is the computability of structure within the computability theory. As the research field progressed, we got new problems. In the com- putability of structures, the actual problem was efficient. To fill this gap in the paper "Algebraic structures computable without delay", the au- thors defined fully primitive recursive structures. Then, in 2019 in the paper "Foundations of Online Structure Theory" the authors defined a new research area "online structures" and renamed the fully primitive recursive structures as punctual structures. In this work, I presented a comprehensive survey of all available articles on punctually computable structures.en_US
dc.identifier.citationTursynov, A. (2024). Computability of algebraic structures. Nazarbayev University School of Sciences and Humanitiesen_US
dc.identifier.urihttp://nur.nu.edu.kz/handle/123456789/7786
dc.language.isoenen_US
dc.publisherNazarbayev University School of Sciences and Humanitiesen_US
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.subjectType of access: Restricteden_US
dc.subjectComputabilityen_US
dc.subjectPunctual structuresen_US
dc.subjectComputable algebras.en_US
dc.titleCOMPUTABILITY OF ALGEBRAIC STRUCTURESen_US
dc.typeMaster's thesisen_US
workflow.import.sourcescience

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Thesis_Adil_Tursynov_ (5).pdf
Size:
362.85 KB
Format:
Adobe Portable Document Format
Description:
Master's Thesis
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: