算法随机性与逼近元.pdfVIP

  • 4
  • 0
  • 约3.19万字
  • 约 13页
  • 2019-01-10 发布于北京
  • 举报
StudiesinLogic,Vol.11,No.2(2018):62–74 PII:1674-3202(2018)-02-0062-13 AlgorithmicRandomnessandApproximate Identities* ChaoChen InstituteofLogicandCognition,SunYat-senUniversity DepartmentofPhilosophy,SunYat-senUniversity chench53.logic@ Abstract. In this paper, we will provide an effective version of Differentiation Theorem for Approximate Identities. We prove that a point is Schnorr random, if and only if Dif-

文档评论(0)

1亿VIP精品文档

相关文档