Author:
Carl Merlin,Schlicht Philipp
Reference33 articles.
1. [2] Carl, M., “Towards a Church–Turing-thesis for infinitary computations,” preprint, arXiv:1307.6599v1 [math.LO].
2. [8] Hjorth, G., “Vienna notes on effective descriptive set theory and admissible sets,” preprint, http://www.math.uni-bonn.de/people/logic/events/young-set-theory-2010/Hjorth.pdf.
3. [5] Downey, R. G., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer, New York, 2010.
4. [1] Bartoszyński, T., and H. Judah, Set Theory: On the Structure of the Real Line, A. K. Peters, Wellesley, Mass., 1995.
5. [3] Carl, M., T. Fischbach, P. Koepke, R. Miller, M. Nasfi, and G. Weckbecker, “The basic theory of infinite time register machines,” Archive for Mathematical Logic, vol. 49 (2010), pp. 249–73.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献