Frequency Computations and the Cardinality Theorem
作者： Valentina Harizanov , Martin Kummer , Jim Owings
DOI: 10.2307/2275300
关键词: Discrete mathematics 、 μ operator 、 Mathematics 、 Recursive set 、 Computation 、 Computability 、 Cardinality (SQL statements) 、 Combinatorics 、 Recursive functions
摘要:
philpapers.org
sci-hub.se 参考文章(6)
Robert McNaughton, The Theory of Automata, a Survey Advances in Computers. ,vol. 2, pp. 379- 421 ,(1961) , 10.1016/S0065-2458(08)60144-8
Richard Beigel, Query-limited reducibilities Stanford University. ,(1988)
R. Beigel, W.I. Gasarch, J. Gill, J.C. Owings, Terse, superterse, and verbose sets Information & Computation. ,vol. 103, pp. 68- 85 ,(1993) , 10.1006/INCO.1993.1014
E. B. Kinber, On frequency-enumerable sets Algebra and Logic. ,vol. 13, pp. 226- 237 ,(1974) , 10.1007/BF01463139
James C. Owings, A Cardinality Version of Biegel's Nonspeedup Theorem Journal of Symbolic Logic. ,vol. 54, pp. 761- 767 ,(1989) , 10.2307/2274739
Martin Kummer, A Proof of Beigel's Cardinality Conjecture Journal of Symbolic Logic. ,vol. 57, pp. 677- 681 ,(1992) , 10.2307/2275299