Difference between revisions of "Approximation"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
[[wikipedia:Approximation|Approximation]] can be formulated rigorously using [[abstract interpretation]] or topological [[limit|limit]]s. The ideas can be found in the two | [[wikipedia:Approximation|Approximation]] can be formulated rigorously using [[abstract interpretation]] or topological [[limit|limit]]s. The ideas can be found in the two areas of intellectual threads by [[Patrick Cousot]]<ref>{{:Paper/Abstract Interpretation}}</ref> and [[Leslie Valiant]]<ref>{{:Book/Probably Approximately Correct}}</ref> respectively. | ||
<noinclude> | <noinclude> | ||
Revision as of 10:12, 23 February 2022
Approximation can be formulated rigorously using abstract interpretation or topological limits. The ideas can be found in the two areas of intellectual threads by Patrick Cousot[1] and Leslie Valiant[2] respectively.
References
- ↑ Cousot, Patrick; Cousot, Radhia (1977). Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints (PDF). 4th POPL. local page: ACM Press. p. 238-252.
- ↑ Valiant, Leslie (2013). Probably Approximately Correct - Nature’s Algorithms for Learning and Prospering in a Complex World. local page: Basic Books. ISBN 978-0-465-03271-6.