Results 1 to 10 of about 4,903,854 (193)
Asymptotic Density for Equivalence
Electronic Notes in Theoretical Computer Science, 2005 In this paper we study the asymptotic behavior of the fraction of true formulas against all formulas over k propositional variables with equivalence as the only connective in the language. We consider two ways of measuring the asymptotic behavior. In the
Grzegorz Matecki
exaly +3 more sources
Asymptotic density, immunity and randomness [PDF]
Computability, 2014 In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases.
Eric P. Astor
semanticscholar +4 more sources
Ultrafilter extensions of asymptotic density [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 We characterize for which ultrafilters on ω is the ultrafilter extension of the asymptotic density on natural numbers σ-additive on the quotient boolean algebra P (ω) /dU or satisfies similar additive condition on P (ω) /fin.
Grebík Jan
semanticscholar +4 more sources
Asymptotic Density of Zimin Words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Word $W$ is an instance of word $V$ provided there is a homomorphism $\phi$ mapping letters to nonempty words so that $\phi(V) = W$. For example, taking $\phi$ such that $\phi(c)=fr$, $\phi(o)=e$ and $\phi(l)=zer$, we see that "freezer" is an instance of
Joshua Cooper, Danny Rorabaugh
doaj +5 more sources
Asymptotic density of states in 2d CFTs with non-invertible symmetries [PDF]
Journal of High Energy Physics, 2023 It is known that the asymptotic density of states of a 2d CFT in an irreducible representation ρ of a finite symmetry group G is proportional to (dim ρ)2.
Ying-Hsuan Lin +3 more
doaj +2 more sources
Asymptotic density and computably Enumerable Sets [PDF]
Journal of Mathematical Logic, 2013 We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e.
R. Downey, C. Jockusch, P. Schupp
semanticscholar +4 more sources
Asymptotic density and the Ershov hierarchy [PDF]
Mathematical Logic Quarterly, 2013 We classify the asymptotic densities of the Δ20 sets according to their level in the Ershov hierarchy. In particular, it is shown that for n≥2 , a real r∈[0,1] is the density of an n‐c.e. set if and only if it is a difference of left‐ Π20 reals. Further,
R. Downey +3 more
semanticscholar +5 more sources
Asymptotic Structure for the Clique Density Theorem [PDF]
Discrete Analysis, 2020 Asymptotic structure for the clique density theorem, Discrete Analysis 2020:19, 26 pp. Turán's theorem, which is regarded as the "first" result in extremal graph theory, is the statement that the $K_r$-free graph on $n$ vertices with the largest number ...
Jaehoon Kim +3 more
doaj +3 more sources
Additive Complements for a Given Asymptotic Density [PDF]
Mediterranean Journal of Mathematics, 2018 We investigate the existence of subsets A and B of N:={0,1,2,⋯}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
A. Faisant +3 more
semanticscholar +5 more sources
Asymptotic density and the coarse computability bound [PDF]
Computability, 2015 For r ∈ [ 0 , 1 ] we say that a set A ⊆ ω is coarsely computable at density r if there is a computable set C such that { n : C ( n ) = A ( n ) } has lower density at least r. Let γ ( A ) = sup { r : A is coarsely computable at density r } .
D. Hirschfeldt +3 more
semanticscholar +6 more sources