The basic feasible functionals in computable analysis

DOI10.1016/j.jco.2006.06.005zbMath1113.03056OpenAlexW2075728787MaRDI QIDQ864439

Branimir Lambov

Publication date: 8 February 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.06.005

zbMATH Keywords

basic feasible functionalscomplexity in analysispoly-time computabilitypolynomial-time computable real functions

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Related Items

Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Continuous and monotone machines ⋮ Representations and evaluation strategies for feasibly approximable functions ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines

Cites Work

• Unnamed Item
• Unnamed Item
• Functional interpretations of feasibly constructive arithmetic
• Polynomial and abstract subrecursive classes
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• A new Characterization of Type-2 Feasibility
• Computer Science Logic