Predictive recursion and computational complexity
Predictive recursion and computational complexity
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Complexity and real computation
Complexity and real computation
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
Journal of Logic and Computation
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
| Hi-index | 0.89 |
In [O. Bournez, F. Cucker, P.J. de Naurois, J.Y. Marion, Computability over an arbitrary structure. Sequential and parallel polynomial time, in: Lecture Notes in Computer Science, vol. 2620, Springer, Berlin, 2003, pp. 185-199] the class of safe recursive functions over an arbitrary structure is defined. A question of simulation of the simultaneous safe recursion by single safe recursion was set. We prove that this simulation is feasible using bounded coding and decoding functions.