scientific article

From MaRDI portal
Publication:4040360

zbMath0648.00002MaRDI QIDQ4040360

No author found.

Publication date: 5 June 1993


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



Related Items (27)

Computational depth and reducibilityCellular automata universality revisitedDynamically changing interface as a model of measurement in complex systemsAn almost machine-independent theory of program-length complexity, sophistication, and inductionWeakly useful sequencesRandomness and universal machinesRecursive computational depthFormalism and intuition in computabilityOn Goles' universal machines: a computational point of viewDepth, Highness and DNR DegreesEvent‐enhanced quantum theory and piecewise deterministic dynamicsKolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)Real patterns and indispensabilityFace Representations via Tensorfaces of Various ComplexitiesComputability and RecursionExperience, generations, and limits in machine learningDecoding Genomic InformationWhy Turing’s Thesis Is Not a ThesisMartin Davis’s Bibliography 1950–2015Alonzo church:his life, his work and some of his miraclesRecursively enumerable reals and Chaitin \(\Omega\) numbersAnalogue MIMO detectionMathematical and Technological ComputabilityTuring oracle machines, online computing, and three displacements in computability theoryConstructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint SessionThe Developments of the Concept of Machine Computability from 1936 to the 1960sSome thoughts on computational models: from massive human computing to abstract state machines, and beyond




This page was built for publication: