Pages that link to "Item:Q5765445"
From MaRDI portal
The following pages link to On Computable Numbers, with an Application to the Entscheidungsproblem (Q5765445):
Displaying 50 items.
- Simple urban simulation atop complicated models: multi-scale equation-free computing of sprawl using geographic automata (Q280446) (← links)
- Unpredictability and the transmission of numbers (Q291548) (← links)
- Distinguishing between evidence and its explanations in the steering of atomic clocks (Q309343) (← links)
- Objective computation versus subjective computation (Q320171) (← links)
- Intractability and the use of heuristics in psychological explanations (Q383037) (← links)
- The mentor of Alan Turing: Max Newman (1897--1984) as a logician (Q384416) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- From heaps of matches to the limits of computability (Q396877) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Disentangling complexity from randomness and chaos (Q405986) (← links)
- Life as thermodynamic evidence of algorithmic structure in natural environments (Q406210) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- Computation as an unbounded process (Q418791) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Syntactic structures and recursive devices: a legacy of imprecision (Q438595) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- Constructor theory (Q484915) (← links)
- Ideal negative conceivability and the halting problem (Q485625) (← links)
- Computable neighbourhoods of points in semicomputable manifolds (Q508833) (← links)
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- Identification of probabilities (Q514153) (← links)
- Notes on computable analysis (Q519888) (← links)
- Randomness on computable probability spaces -- a dynamical point of view (Q537913) (← links)
- The incompleteness theorems after 70 years (Q598275) (← links)
- Cluster state computation with quantum-dot charge qubits (Q606146) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Beta-shifts, their languages, and computability (Q633763) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- Computability of Brolin-Lyubich measure (Q651408) (← links)
- Automated theorem provers: a practical tool for the working mathematician? (Q657585) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Fundamentals of quantum information theory (Q699526) (← links)
- Graph automata: Natural expression of self-reproduction (Q700838) (← links)
- Computability in linear algebra (Q703545) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Robust exponential memory in Hopfield networks (Q723688) (← links)
- Rosen's \((M,R)\) system as an X-machine (Q727124) (← links)
- From reaction-diffusion to physarum computing (Q734218) (← links)
- Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
- Real numbers, continued fractions and complexity classes (Q751655) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Algebraic varieties are homeomorphic to varieties defined over number fields (Q784197) (← links)
- A procedural theory of eye movements in doing arithmetic (Q790763) (← links)
- Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity) (Q804571) (← links)
- Process algebras as support for sustainable systems of services (Q814902) (← links)
