Computability of a Whitney Extension
Andrea Brun, Guido Gherardi, Alberto Marcone

TL;DR
This paper establishes the computability of Whitney Extension for functions defined on closed sets in Euclidean space, given a suitable representation that allows for the computation of the distance function.
Contribution
It proves that under specific representations, the Whitney Extension operator is computable for functions on closed sets in Euclidean space.
Findings
The extension function can be computed from the Whitney jet and the distance function.
The result applies to functions with derivatives up to order m on closed sets.
Computability is achieved under suitable representations of the input data.
Abstract
We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if is a closed set represented so that the distance function can be computed, and is a Whitney jet of order on , then we can compute such that and its partial derivatives coincide on with the corresponding functions of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
