• DML-CZ Home

03D60 Computability and recursion theory on ordinals, admissible sets, etc. (9 articles)

• Jančar, Petr: Decidability questions for some dynamic properties of Petri nets [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 201
• Kršňáková, Jana: Selfgenerating sequences and different types of computational devices [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 201
• Ďuriš, Pavol: Two new proof techniques for investigating the computational power of two-way computing devices [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 197-198
• Šebelík, Jan: Horn clause programs and recursive functions defined by systems of equations. (English). Kybernetika, vol. 18 (1982), issue 2, pp. 106-120
• Pultr, A.; Úlehla, J.: On two problems of mice. (English). In: Frolík, Zdeněk (ed.): Proceedings of the 10th Winter School on Abstract Analysis. Circolo Matematico di Palermo, Palermo, 1982. pp. [249]-262
• Lukavcová, Milena: On computable real functions. (English). Kybernetika, vol. 16 (1980), issue 3, pp. (240)-247
• Nekvinda, Miloslav: Memory complexity of countable functions. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (88)-99
• Mareš, Jan: Conditional programmed automata. (English). Kybernetika, vol. 14 (1978), issue 4, pp. (227)-244
• Demuth, O.; Kryl, R.; Kučera, A.: Об использовании теории функций частично-рекурсивных относительно числовых множеств в конструктивной математике. (Russian) [On the applications of the theory of partially-recursive functions with respect to the sets in constructive mathematics]. Acta Universitatis Carolinae. Mathematica et Physica, vol. 19 (1978), issue 1, pp. 15-60