What is a POLYNOMIAL-TIME Computable L2-Function?

Aras Bacho, Svetlana Selivanova, Martin Ziegler

We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).