scientific article; zbMATH DE number 412149
From MaRDI portal
Publication:3135831
Recommendations
Cited in
(19)- Algorithms and algorithmic problems
- Do stronger definitions of randomness exist?
- From logic to tiling
- The creating subject, the Brouwer-Kripke schema, and infinite proofs
- Basic concepts in algorithms and complexity theory
- scientific article; zbMATH DE number 4022632 (Why is no real title available?)
- scientific article; zbMATH DE number 4028893 (Why is no real title available?)
- scientific article; zbMATH DE number 53101 (Why is no real title available?)
- scientific article; zbMATH DE number 194513 (Why is no real title available?)
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
- Elementary algorithms and their implementations
- Kolmogorov entropy in the context of computability theory
- Kolmogorov complexity conditional to large integers
- Numberings, c.e. oracles, and fixed points
- On computable numberings of families of Turing degrees
- Testing exchangeability in the batch mode with e-values and Markov alternatives
- On e-principal and e-complete numberings
- Judgmental and definitional equality from a Fregean perspective
- On basic mathematical definitions of digital technologies and artificial intelligence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135831)