scientific article

From MaRDI portal

Revision as of 21:53, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3135831

Jump to:navigation, search

zbMath0786.68032MaRDI QIDQ3135831

A. L. Semenov, Vladimir A. Uspensky

Publication date: 12 September 1993

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

zbMATH Keywords

computational complexity probabilistic algorithms decidability computable functions recursive functions computational models theory of algorithms calculi generable sets time and space complexities

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx)

Related Items (7)

Numberings, c.e. oracles, and fixed points ⋮ Do stronger definitions of randomness exist? ⋮ The creating subject, the Brouwer-Kripke schema, and infinite proofs ⋮ Kolmogorov entropy in the context of computability theory ⋮ Kolmogorov complexity conditional to large integers ⋮ Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) ⋮ From logic to tiling

This page was built for publication:

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