scientific article; zbMATH DE number 4114603

zbMath0681.03019MaRDI QIDQ4729767

Christian Michaux

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite-dimensional machine over \({\mathbb{R}}\)

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (13)

Computing over the reals with addition and order ⋮ On the relations between distributive computability and the BSS model ⋮ Some Results on Interactive Proofs for Real Computations ⋮ On NC-real complexity classes for additive circuits and their relations with NC ⋮ Small space analogues of Valiant's classes and the limitations of skew formulas ⋮ Time-space tradeoffs in algebraic complexity theory ⋮ A note on parallel and alternating time ⋮ \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) ⋮ Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH ⋮ On measures of space over real and complex numbers ⋮ On digital nondeterminism ⋮ Interactive proofs and a Shamir-like result for real number computations ⋮ Logics which capture complexity classes over the reals

This page was built for publication: