Pages that link to "Item:Q2608913"
From MaRDI portal
The following pages link to On computable numbers, with an application to the Entscheidungsproblem. (Q2608913):
Displaying 20 items.
- On computable numbers, with an application to the Druckproblem (Q6548953) (← links)
- Unprincipled (Q6552265) (← links)
- Divergent predictive states: the statistical complexity dimension of stationary, ergodic hidden Markov processes (Q6556920) (← links)
- Unpredictability and entanglement in open quantum systems (Q6559631) (← links)
- Semantics, specification logic, and Hoare logic of exact real computation (Q6563064) (← links)
- An arithmetic analysis of closed surfaces (Q6567114) (← links)
- The surjection property and computable type (Q6592027) (← links)
- From quantum foundations via natural language meaning to a theory of everything (Q6599285) (← links)
- Algorithmic economics: incomputability, undecidability and unsolvability in economics (Q6599288) (← links)
- Algebraic topology and distributed computing (Q6620125) (← links)
- Learning from the masters (and some of their pupils) (Q6623911) (← links)
- The internal logic and finite colimits (Q6633054) (← links)
- Countability constraints in order-theoretic approaches to computability (Q6635153) (← links)
- Compositional reversible computation (Q6637582) (← links)
- Decidable fragments of the quantified argument calculus (Q6638233) (← links)
- The paternity of the modern computer (Q6639623) (← links)
- Testing randomness by Matching Pennies (Q6643370) (← links)
- The Expressive Power of the<i>N</i>-Operator and the Decidability of Logic in Wittgenstein’s<i>Tractatus</i> (Q6650607) (← links)
- Cognitive and computational complexity: considerations from mathematical problem solving (Q6652877) (← links)
- Monotone versus non-monotone projective operators (Q6663909) (← links)
