Feasible Real Random Access Machines

We present a modified real RAM model which is equipped with the usual discrete and real-valued arithmetic operations and with a finite precision test <kwhich allows comparisons of real numbers only up to a variable uncertainty 1/(k+1). Furthermore, ourfeasible RAMhas an extended semantics which a...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of Complexity Vol. 14; no. 4; pp. 490 - 526
Main Authors:	Brattka, Vasco, Hertling, Peter
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.1998
Subjects:	complexity in analysis computability computational complexity computability complexity in analysis computational complexity
ISSN:	0885-064X, 1090-2708
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!