scientific article; zbMATH DE number 497572

From MaRDI portal

Revision as of 19:11, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4278590

Jump to:navigation, search

zbMath0795.03053MaRDI QIDQ4278590

Mark S. Burgin

Publication date: 13 March 1994

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

zbMATH Keywords

optimization algorithms real numbers program semantics inductive Turing machines computations over the real field fundamental Turing machines limit Turing machines representation of numerical methods

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (5)

Preface: Super-recursive algorithms and hypercomputation. ⋮ Algorithmic complexity of recursive and inductive algorithms ⋮ Super-tasks, accelerating Turing machines and uncomputability ⋮ Natural computation and non-Turing models of computation ⋮ The case for hypercomputation

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4278590&oldid=18198862"