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).

翻译：本文提出了L2函数多项式时间可计算性的两种自然定义；并证明它们在复杂性类FP_1不包含#P_1的前提下是不可比较的。