A hierarchy below the halting problem for additive machines
type: Item
instance of: scholarly article
title: A hierarchy below the halting problem for additive machines
zbMATH Open document ID: 1166.68017
author: Christine Gaßner
published in: Theory of Computing Systems
publication date: 2009-05-08T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D28
zbMATH DE Number: 5552166
zbMATH Keywords: BSS model
zbMATH Keywords: additive machines
zbMATH Keywords: Post's problem
zbMATH Keywords: Turing degrees
zbMATH Keywords: halting problem
MaRDI profile type: Publication
full work available at URL: s00224-007-9020-y
OpenAlex ID: W2116191550
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: Computing over the reals with addition and order: Higher complexity classes
cites work: Q2754200
cites work: Computing over the reals with addition and order
cites work: Fundamentals of Computation Theory
cites work: Logical Approaches to Computational Barriers
cites work: An explicit solution to Post's problem over the reals
cites work: Recursively enumerable sets of positive integers and their decision problems
DOI: 10.1007/S00224-007-9020-Y
description: scientific article; zbMATH DE number 5552166