
Universal computably enumerable sets and initial segment prefix-free complexity
Keywords: قابل محاسبه مجدد; Universal sets; Computably enumerable; Kolmogorov complexity; Initial segment complexity