Strong Turing Degrees for Additive BSS RAM's

DOI10.2168/LMCS-9(4:25)2013zbMath1315.03069arXiv1312.3927MaRDI QIDQ2871478

Christine Gaßner

Publication date: 8 January 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3927

zbMATH Keywords

halting problemTuring degreesadditive machinesBSS modeloracle machine

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Other Turing degree structures (03D28)

Related Items (2)

Computation over algebraic structures and a classification of undecidable problems ⋮ A Survey on Analog Models of Computation

This page was built for publication: Strong Turing Degrees for Additive BSS RAM's