Turing's legacy. Developments from Turing's ideas in logic
DOI10.1017/CBO9781107338579zbMATH Open1341.03002OpenAlexW4238504694MaRDI QIDQ2803247FDOQ2803247
Author name not available (Why is that?)
Publication date: 4 May 2016
Published in: Lecture Notes in Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/cbo9781107338579
Recommendations
Collections of articles of miscellaneous specific interest (00B15) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10)
Cited In (33)
- On the effective universality of mereological theories
- Enumerating classes of effective quasi-Polish spaces
- Turing degrees and automorphism groups of substructure lattices
- Measure-theoretic uniformity and the Suslin functional
- Cohesive powers of structures
- Cameo of a Consummate Computabilist
- Investigations on the approximability and computability of the Hilbert transform with applications
- Degree spectra of structures relative to equivalences
- Computable Heyting algebras with distinguished atoms and coatoms
- Categoricity spectra of computable structures
- Decompositions of decidable abelian groups
- Degrees of non-computability of homeomorphism types of Polish spaces
- Computability and non-monotone induction
- COMPUTABLY COMPACT METRIC SPACES
- Punctual dimension of algebraic structures in certain classes
- On two types of concept lattices in the theory of numberings
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- On approximations for functions in the space of uniformly convergent Fourier series
- On bi-embeddable categoricity of algebraic structures
- Computability in infinite Galois theory and algorithmically random algebraic fields
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Inverse problems are solvable on real number signal processing hardware
- Analytic computable structure theory and $L^p$ spaces
- Philosophical explorations of the legacy of Alan Turing. Turing 100
- Alan Turing: Life and Legacy of a Great Thinker
- T for Turing. Machine and, also, uneasiness and desire
- Mathematical reasoning and the computer
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations
- Notes on computable analysis
- Turing degrees of complete formulas of almost prime models
- A structure of punctual dimension two
- Mathematics and the formal turn
This page was built for publication: Turing's legacy. Developments from Turing's ideas in logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803247)
