How to Compute Antiderivatives

DOI10.2307/421157zbMath0838.26007OpenAlexW2066659928MaRDI QIDQ4858804

Chris Freiling

Publication date: 9 May 1996

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/54bc975a95ba6a837b6c3104f647c45d150e68ba

zbMATH Keywords

complexityantiderivativesKleene-type algorithmstotalization process

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Denjoy and Perron integrals, other special integrals (26A39) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Antidifferentiation (26A36)

Cites Work

• Unnamed Item
• Unnamed Item
• Descriptive set theory
• A new proof of the theorem on exponential diophantine representation of enumerable sets
• Inductive definability: Measure and category
• The complexity of antidifferentiation
• A programming language for the inductive sets, and applications
• Cores of Π₁¹ sets of reals
• Differentiation of Real Functions