Computability Theory and Algebraic Structures

Harizanov将可计算理论、模型理论、代数和拓扑学的思想和方法结合起来，研究代数结构上的算法现象。她的目标是更好地理解算法属性如何与代数和拓扑属性相互作用。Harizanov专注于可数模型的复杂性，它们的子模型和关系，以及结构的转换。她研究了可计算结构的模型理论复杂性，通过它们的斯科特等级来衡量。Harizanov研究结构上关系的内在复杂性，通过语法和图灵谱或强度谱来捕获。她将结构的度谱与通过谱通用结构的关系的度谱联系起来，这通常是作为frisse极限得到的。Harizanov研究了低维拓扑和代数中重要的岩浆、半群和群上的左阶和双阶空间。她将它们的拓扑性质与可计算性理论的性质联系起来。Harizanov还研究了同构的算法复杂性。这包括特定和一般可计算结构的有效分类。它还包括部分和全部自同构的研究。一个方向是发展可计算结构的自同构度谱理论。另一个方向是研究部分自同构的各种半群，以及如何从这些半群中恢复结构。可计算性理论发明于20世纪30年代，为现代可编程计算机的诞生铺平了道路。该领域的主要推力是了解算法计算的局限性，而不考虑物理实现。可计算理论与模型理论和通用代数，以及其他数学领域的相互作用，导致了可计算模型理论，更广泛地说，在可计算数学，一个非常活跃的研究领域，在过去的几十年。Harizanov提出的研究包括可计算数学的广泛主题。她研究了什么时候一些数学结构是算法的，或者可以被产生相同结果的算法结构所取代，以及什么时候它们从根本上是非算法的。不确定集合，以及这些集合编码的问题，可以通过考虑带有预言的算法来更精确地分类，这需要外部知识。图灵和其他可计算理论学位在哈里扎诺夫的项目中发挥了重要作用，它们提供了衡量所需知识水平的重要标准。Harizanov将可计算理论中的度数理论和其他独特方法与代数、组合和拓扑方法结合起来，研究和解释数学其他领域中的重要现象。

Harizanov integrates the ideas and methods from computability theory, model theory, algebra, and topology to investigate algorithmic phenomena on algebraic structures. She aims to better understand how algorithmic properties interact with algebraic and topological ones. Harizanov focuses on the complexity of countable models, their submodels and relations, and transformations of structures. She studies model-theoretic complexity of computable structures measured by their Scott rank. Harizanov investigates intrinsic complexity of relations on structures, captured both syntactically and by their Turing or strong degree spectra. She relates degree spectra of structures to the degree spectra of relations via spectrally universal structures, which are often obtained as Fraisse limits. Harizanov investigates the spaces of left orders and bi-orders on magmas, semigroups, and groups of importance in low-dimensional topology and algebra. She connects their topological properties with computability-theoretic ones. Harizanov also studies algorithmic complexity of isomorphisms. This includes effective categoricity of specific and general computable structures. It also includes the study of partial and total automorphisms. One direction is to develop the theory of automorphism degree spectra of computable structures. The other direction is to investigate various semigroups of partial automorphisms and how the structures can be recovered from these semigroups. Invented in the 1930's, computability theory paved the way for the creation of the modern programmable computer. The main thrust of the field is to understand the limitations on algorithmic computation, without regard for the physical implementation. Interaction of computability theory with model theory and universal algebra, as well as other areas of mathematics, has resulted in computable model theory and, more generally, in computable mathematics, a very active research area in the last few decades. Harizanov's proposed research includes a broad range of topics in computable mathematics. She investigates when some mathematical constructions are algorithmic, or can be replaced by algorithmic ones yielding the same results, and when they are fundamentally nonalgorithmic. Undecidable sets, as well as problems these sets encode, can be more precisely classified by considering algorithms with oracles, which require external knowledge. Turing and other computability-theoretic degrees, which play a significant role in Harizanov's project, provide an important measure of the level of such knowledge needed. Harizanov combines degree-theoretic and other unique methods from computability theory with algebraic, combinatorial and topological methods to study and explain phenomena of importance in other areas of mathematics.