Author:
Carl Merlin,Fischbach Tim,Koepke Peter,Miller Russell,Nasfi Miriam,Weckbecker Gregor
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Dimitriou, I., Hamkins, J.D., Koepke, P. (eds.): BIWOC—Bonn International Workshop on Ordinal Computability, Bonn Logic Reports (2007)
2. Hamkins J.D., Lewis A.: Infinite time turing machines. J. Symb. Log. 65(2), 567–604 (2000)
3. Hamkins, J.D., Linetsky, D., Miller, R.: The complexity of quickly ORM-decidable sets. In: Cooper, S.B., et al. (eds.) Computation and Logic in the Real World, LNCS, vol. 4497, pp. 488–496. Springer, Heidelberg (2007)
4. Hamkins, J.D., Miller, R.: Post’s problem for ordinal register machines. In: Cooper, S.B., et al. (eds.) Computation and Logic in the Real World, LNCS. vol. 4497, pp. 358–367. Springer, Heidelberg (2007)
5. Koepke P., et al.: Infinite time register machines. In: Beckmann, A., (eds) Logical Approaches to Computational Barriers, LNCS. vol. 3988, pp. 257–266. Springer, Heidelberg (2006)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献