The following pages link to (Q4040360):
Displayed 23 items.
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Randomness and universal machines (Q864423) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Dynamically changing interface as a model of measurement in complex systems (Q1349371) (← links)
- Experience, generations, and limits in machine learning (Q1434369) (← links)
- Analogue MIMO detection (Q2502502) (← links)
- An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- Depth, Highness and DNR Degrees (Q2947871) (← links)
- Decoding Genomic Information (Q3295748) (← links)
- Martin Davis’s Bibliography 1950–2015 (Q3305330) (← links)
- Alonzo church:his life, his work and some of his miracles (Q4391354) (← links)
- Recursive computational depth (Q4571946) (← links)
- Computational depth and reducibility (Q4630267) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- Weakly useful sequences (Q4645195) (← links)
- Event‐enhanced quantum theory and piecewise deterministic dynamics (Q4857551) (← links)
- Mathematical and Technological Computability (Q4972862) (← links)
- Face Representations via Tensorfaces of Various Complexities (Q5131175) (← links)
- Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session (Q5250212) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- Computability and Recursion (Q5689263) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)