A topological view on algebraic computation models
type: Item
instance of: scholarly article
title: A topological view on algebraic computation models
author: Eike Neumann
author: Arno Pauly
published in: Journal of Complexity
publication date: 2017-11-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1602.08004
full work available at URL: 0037369-08122017134446.pdf
Mathematics Subject Classification ID: 03-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 6810590
zbMATH Keywords: Weihrauch reducibility
zbMATH Keywords: BSS-machine
zbMATH Keywords: analytic machine
zbMATH Keywords: effective DST
zbMATH Keywords: solvability complexity index
zbMATH Keywords: computable analysis
describes a project that uses: SINGULAR
MaRDI profile type: Publication
OpenAlex ID: W2407347945
cites work: New barriers in complexity theory: on the solvability complexity index and the towers of algorithms
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Equality is a jump
cites work: Effective Borel measurability and reducibility of functions
cites work: Closed choice and a uniform low basis theorem
cites work: Effective Choice and Boundedness Principles in Computable Analysis
cites work: Weihrauch degrees, omniscience principles and weak computability
cites work: Probabilistic computability and choice
cites work: The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
cites work: Feasible real random access machines
cites work: On the Computational Content of the Brouwer Fixed Point Theorem
cites work: Computability of Julia sets
cites work: Q3754620
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
cites work: Noncomputable functions in the Blum-Shub-Smale model
cites work: Analytic machines
cites work: Levels of discontinuity, limit-computability, and jump operators
cites work: On uniform relationships between combinatorial problems
cites work: Synthetic topology: of data types and classical spaces
cites work: Computability of Analytic Functions with Analytic Machines
cites work: On NP-completeness for linear machines
cites work: The P-DNP problem for infinite Abelian groups
cites work: A hierarchy below the halting problem for additive machines
cites work: On Relativizations of the P =? NP Question for Several Structures
cites work: A Singular Introduction to Commutative Algebra
cites work: Computable functionals
cites work: On the definitions of computable real continuous functions
cites work: On the Solvability Complexity Index, the 𝑛-pseudospectrum and approximations of spectra of operators
cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling
cites work: Is the Mandelbrot set computable?
cites work: The degree structure of Weihrauch-reducibility
cites work: Slicing the Truth
cites work: On notions of computability-theoretic reduction between Π21 principles
cites work: Algorithmic properties of polynomial rings
cites work: Q4002474
cites work: Q3226754
cites work: An explicit solution to Post's problem over the reals
cites work: On Σ‐definability without equality over the real numbers
cites work: Q3075220
cites work: On the (semi)lattices induced by continuous reducibilities
cites work: On the topological aspects of the theory of represented spaces
cites work: Q4643953
cites work: Non-deterministic computation and the Jayne-Rogers Theorem
cites work: Q3994907
cites work: Q3751553
cites work: Q4485693
cites work: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
cites work: Real hypercomputation and continuity
cites work: Revising Type-2 Computation and Degrees of Discontinuity
DOI: 10.1016/J.JCO.2017.08.003
description: scientific article; zbMATH DE number 6810590