scientific article
From MaRDI portal
Publication:3135831
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.
computational complexityprobabilistic algorithmsdecidabilitycomputable functionsrecursive functionscomputational modelstheory of algorithmscalculigenerable setstime and space complexities
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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:
