scientific article; zbMATH DE number 193560
From MaRDI portal
Publication:4040360
zbMATH Open0648.00002MaRDI QIDQ4040360FDOQ4040360
Authors:
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Proceedings, conferences, collections, etc. pertaining to history and biography (01-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Conference proceedings and collections of articles (00Bxx)
Cited In (32)
- On Goles' universal machines: a computational point of view
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Dynamically changing interface as a model of measurement in complex systems
- Randomness and universal machines
- Formalism and intuition in computability
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
- Mathematical and Technological Computability
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Decoding Genomic Information
- Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session
- Recursive computational depth
- Martin Davis’s Bibliography 1950–2015
- Experience, generations, and limits in machine learning
- Computability and Recursion
- Face Representations via Tensorfaces of Various Complexities
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality
- Title not available (Why is that?)
- Event‐enhanced quantum theory and piecewise deterministic dynamics
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Turing oracle machines, online computing, and three displacements in computability theory
- Analogue MIMO detection
- Computational depth and reducibility
- 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
- Title not available (Why is that?)
- Alonzo church:his life, his work and some of his miracles
- The Developments of the Concept of Machine Computability from 1936 to the 1960s
- Real patterns and indispensability
- Cellular automata universality revisited
- Depth, Highness and DNR Degrees
- Title not available (Why is that?)
- Why Turing’s Thesis Is Not a Thesis
- Weakly useful sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040360)
