Eliminating unbounded search in computable algebra

DOI10.1007/978-3-319-58741-7_8MaRDI QIDQ2011637zbMATH OpenOpenAlexFDO

Authors Alexander Melnikov

Publication date 4 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-58741-7_8

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Algebraic structures computable without delay
• Computers and universal algebra: Some directions
• scientific article; zbMATH DE number 3936508
• scientific article; zbMATH DE number 23020
• Issues of algorithmics and Glushkov's systems of algorithmic algebras

Cites work

• scientific article; zbMATH DE number 5605134 (Why is no real title available?)
• scientific article; zbMATH DE number 1405578 (Why is no real title available?)
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• A computability theoretic equivalent to Vaught's conjecture
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• A survey of homogeneous structures
• Algebraic structures computable without delay
• Automatic Structures: Richness and Limitations
• Breaking up finite automata presentable torsion-free Abelian groups.
• Computable structures and the hyperarithmetical hierarchy
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Existence and uniqueness of structures computable in polynomial time
• FA-presentable groups and rings
• Finite Automata Presentable Abelian Groups
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Recursive Boolean algebras with recursive atoms
• Some constructivizations of Abelian groups
• Space complexity of abelian groups
• Subgroups of finitely presented groups
• The additive group of the rationals does not have an automatic presentation
• The diversity of categoricity without delay
• The word problem

Cited in

(18)

• Punctual definability on structures
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• New degree spectra of Polish spaces
• Primitive recursive equivalence relations and their primitive recursive complexity
• Punctual dimension of algebraic structures in certain classes
• Definable Subsets of Polynomial-Time Algebraic Structures
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• The back-and-forth method and computability without delay
• A structure of punctual dimension two
• Rogers semilattices of punctual numberings
• Graphs are not universal for online computability
• On bi-embeddable categoricity of algebraic structures
• Algebraic structures computable without delay
• Computable embeddability for algebraic structures
• Online presentations of finitely generated structures
• scientific article; zbMATH DE number 36613 (Why is no real title available?)
• Primitive recursive reverse mathematics

This page was built for publication: Eliminating unbounded search in computable algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011637)