Some Questions in Computable Mathematics
From MaRDI portal
Cites work
- \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
- d-computable categoricity for algebraic fields
- A _2⁰ set with no infinite low subset in either it or its complement
- A computable functor from graphs to fields
- A separation of two randomness concepts
- A unified approach to the definition of random sequences
- A unifying approach to the Gamma question
- Algorithmic randomness and complexity.
- Approximations to the halting problem
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Asymptotic density and the coarse computability bound
- Asymptotic density and the Ershov hierarchy
- Asymptotic density, computable traceability, and 1-randomness
- Autostability of models
- Calibrating Randomness
- Categoricity properties for computable algebraic fields
- Coarse reducibility and algorithmic randomness
- Coherent randomness tests and computing the \(K\)-trivial sets
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Comparing notions of randomness
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Computable Boolean algebras
- Computable categoricity of trees of finite height
- Computable functors and effective interpretability
- Computable trees, prime models, and relative decidability
- Concerning similarity transformations of linearly ordered sets
- Cone avoiding closed sets
- Constructive models of complete solvable theories
- Counting the changes of random _2⁰ sets
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of prime models
- Degrees coded in jumps of orderings
- Degrees of orderings not isomorphic to recursive linear orderings
- Degrees of Structures
- Density-1-bounding and quasiminimality in the generic degrees
- Effective prime uniqueness
- Enumerations and completely decomposable torsion-free abelian groups
- Enumerations, countable structures and Turing degrees
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every sequence is reducible to a random one
- Foundations of recursive model theory
- Generic computability, Turing degrees, and asymptotic density
- Generic-case complexity, decision problems in group theory, and random walks.
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 2063217 (Why is no real title available?)
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- scientific article; zbMATH DE number 3446873 (Why is no real title available?)
- scientific article; zbMATH DE number 1421071 (Why is no real title available?)
- scientific article; zbMATH DE number 969633 (Why is no real title available?)
- scientific article; zbMATH DE number 3328143 (Why is no real title available?)
- scientific article; zbMATH DE number 2237373 (Why is no real title available?)
- Hyperarithmetically Encodable Sets
- Kolmogorov-Loveland randomness and stochasticity
- Limitwise monotonic sequences and degree spectra of structures
- Mathematical metaphysics of randomness
- Nonexistence of minimal pairs for generic computability
- Omitting types, type spectrums, and decidability
- On computable self-embeddings of computable linear orderings
- On notions of computability-theoretic reduction between Π21 principles
- On self-embeddings of computable linear orderings
- On the complexity of the successivity relation in computable linear orderings
- On the construction of effectively random sets
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- On uniform relationships between combinatorial problems
- Open questions about Ramsey-type statements in reverse mathematics
- Partition Theorems and Computability Theory
- Problem of the number of non-self-equivalent constructivizations
- Ramsey's theorem and recursion theory
- Ramsey's theorem for singletons and strong computable reducibility
- Random reals and Lipschitz continuity
- Randomness and Computability: Open Questions
- Randomness and reducibility
- Randomness and the linear degrees of computability
- Randomness, computability, and density
- Recursive and r.e. quotient Boolean algebras
- Recursively Categorical Linear Orderings
- Recursively presentable prime models
- Relative to any nonrecursive set
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Spectra of high_n and non-low_n degrees
- Strong reductions between combinatorial principles
- The _2⁰-spectrum of a linear order
- The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals
- The inductive strength of Ramsey's theorem for pairs
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- The weakness of being cohesive, thin or free in reverse mathematics
- Using random sets as oracles
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(10)- The reverse mathematics of non-decreasing subsequences
- Questions inspired by Mikael Passare's mathematics
- Generic complexity of the membership problem for semigroups of integer matrices
- A minimal pair in the generic degrees
- The gamma question for many-one degrees
- scientific article; zbMATH DE number 5252403 (Why is no real title available?)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Generic complexity of the word problem in some semigroups
- Generic polynomial algorithms for the knapsack problem in some matrix semigroups
- On generic complexity of Diophantine problem in parametric form
This page was built for publication: Some Questions in Computable Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973717)
