6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.LO2015★ 1 cited
Towards A Theory Of Quantum Computability
Stefano Guerrini, Simone Martini, Andrea Masini
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obta…
cs.LO2010★ 6 cited
General Ramified Recurrence is Sound for Polynomial Time
Ugo Dal Lago, Simone Martini, Margherita Zorzi
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivan…