Feasible real random access machines
type: Item
instance of: scholarly article
title: Feasible real random access machines
zbMATH Open document ID: 0913.68099
author: Vasco Brattka
author: P. H. Hertling
published in: Journal of Complexity
publication date: 1999-06-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1251398
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: jcom.1998.0488
OpenAlex ID: W1974032946
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: \(\delta\)-uniform BSS machines
cites work: Recursive characterization of computable real-valued functions and relations
cites work: Fast Multiple-Precision Evaluation of Elementary Functions
cites work: Q4335189
cites work: On the definitions of computable real continuous functions
cites work: Q4002474
cites work: Q5848892
cites work: Q3765758
cites work: The real number model in numerical analysis
cites work: Q3994907
cites work: Q3694703
cites work: Quasi-gcd computations
cites work: Fast online multiplication of real numbers
cites work: Q4040428
cites work: Q3751553
cites work: On the complexity of online computations of real functions
cites work: Type 2 computational complexity of functions on Cantor's space
DOI: 10.1006/JCOM.1998.0488
Recommended article: On approximating the ideal random access machine by physical machines
Recommended article: Q4265619
Recommended article: Fast Simulation of Turing Machines by Random Access Machines
Recommended article: Random access machines with multi-dimensional memories
Recommended article: Parallel random access machines with bounded memory wordsize
Recommended article: Simulation of Parallel Random Access Machines by Circuits
Recommended article: Q3723703
Recommended article: Parallelism in random access machines
Recommended article: Realization of Input-Output Relations by Sequential Machines
Recommended article: Combined hierarchies of finite random access machines
description: scientific article; zbMATH DE number 1251398