Eliminating unbounded search in computable algebra
type: Item
instance of: scholarly article
title: Eliminating unbounded search in computable algebra
zbMATH Open document ID: 1433.03117
DOI: 10.1007/978-3-319-58741-7_8
author: Alexander Melnikov
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C57
zbMATH DE Number: 6756750
MaRDI profile type: Publication
full work available at URL: 978-3-319-58741-7 8
OpenAlex ID: W2613792613
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Existence and uniqueness of structures computable in polynomial time
cites work: The word problem
cites work: BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
cites work: Space complexity of abelian groups
cites work: Q4946095
cites work: Polynomial-time versus recursive models
cites work: Polynomial-time Abelian groups
cites work: Some constructivizations of Abelian groups
cites work: Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
cites work: Subgroups of finitely presented groups
cites work: A computably categorical structure whose expansion by a constant has infinite computable dimension
cites work: Algebraic structures computable without delay
cites work: The diversity of categoricity without delay
cites work: Q3396632
cites work: Automatic Structures: Richness and Limitations
cites work: Q4938557
cites work: A survey of homogeneous structures
cites work: A computability theoretic equivalent to Vaught's conjecture
cites work: Finite Automata Presentable Abelian Groups
cites work: FA-presentable groups and rings
cites work: Recursive Boolean algebras with recursive atoms
cites work: The additive group of the rationals does not have an automatic presentation
description: scientific article; zbMATH DE number 6756750