Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference11 articles.
1. Friedman, Mansfield: Algorithmic procedures. Trans. Am. Math. Soc. 332, 297–312 (1992)
2. Sheila, A.: Greibach. Theory of program structures: Schemes, Semantics, Verification. Springer, Verlag (1975)
3. Stoltenberg-Hansen, V., Moldestad, J., Tucker, J.V.: Finite algorithmic procedures and computation theories. Math. Scand. 46, 77–94 (1980)
4. Kfoury, A.J., Stolboushkin, A.P.: An infinite pebble game and applications. Inf Comput 136, 53–66 (1997)
5. Lynch, N.A., Blum, E.K.: A difference in expressive power between flowcharts and recursion schemes. Math. Syst Theory 12(1), 205–211 (1979)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Abstract Recursion and Intrinsic Complexity;2018-11-23
2. General index;Abstract Recursion and Intrinsic Complexity
3. Symbol index;Abstract Recursion and Intrinsic Complexity
4. Polynomial nullity (0-testing);Abstract Recursion and Intrinsic Complexity
5. Non-uniform complexity in N;Abstract Recursion and Intrinsic Complexity