Pages that link to "Item:Q5768086"
From MaRDI portal
The following pages link to On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction (Q5768086):
Displaying 50 items.
- Simple urban simulation atop complicated models: multi-scale equation-free computing of sprawl using geographic automata (Q280446) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Notes on computable analysis (Q519888) (← links)
- Beta-shifts, their languages, and computability (Q633763) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- Links between physics and set theory. (Q815623) (← links)
- A semilattice of degrees of computable metrics (Q820483) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Superefficiency from the vantage point of computability (Q900476) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- The diagonalization method in quantum recursion theory (Q972447) (← links)
- The complexity of analog computation (Q1077163) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Indirect addressing and the time relationships of some models of sequential computation (Q1140427) (← links)
- Conservative logic (Q1170163) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Markov's constructive analysis; a participant's view (Q1292407) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- A look back on the 20th century (Q1347516) (← links)
- Using macrotransducers to specify partial continuous operators in metric spaces (Q1375271) (← links)
- Counter machines (Q1606993) (← links)
- Reducibility of computable metrics on the real line (Q1703268) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- On approximations for functions in the space of uniformly convergent Fourier series (Q2007611) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Computable reducibility of metrics on the reals (Q2165612) (← links)
- Investigations on the approximability and computability of the Hilbert transform with applications (Q2300755) (← links)
- Real-time computability of real numbers by chemical reaction networks (Q2400944) (← links)
- When good theories make bad predictions (Q2460156) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computabili (Q2631823) (← links)
- Computable structures and operations on the space of continuous functions (Q2804293) (← links)
- Deductive derivation and turing-computerization of semiparametric efficient estimation (Q2809510) (← links)
- Mutual Dimension (Q2832303) (← links)
- Randomness for non-computable measures (Q2846975) (← links)
- Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems (Q2866131) (← links)
- From Turing machines to computer viruses (Q2941590) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Computable topological groups and Pontryagin duality (Q4691089) (← links)
- On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229) (← links)
- Appraising two decades of distributed computing theory research (Q5138493) (← links)
