Timeline for How do we express measurable spaces using type theory?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:37 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Jul 14, 2013 at 12:10 | history | edited | Asaf Karagila♦ |
edited tags
|
|
| Jun 20, 2013 at 14:04 | answer | added | Bas Spitters | timeline score: 9 | |
| Jun 19, 2013 at 8:54 | answer | added | user11618 | timeline score: 6 | |
| Jun 19, 2013 at 4:52 | vote | accept | Tom LaGatta | ||
| Jun 19, 2013 at 4:51 | comment | added | Tom LaGatta | @Qiaochu: thank you! I did not know this. So this is a way to model any arbitrary finite set, correct? ncatlab.org/nlab/show/hereditarily+finite+set | |
| Jun 19, 2013 at 4:47 | comment | added | Tom LaGatta | @Matteo: yes, that's exactly the point. Furthermore, I want to have the flexibility of dealing with arbitrary belief hierarchies. e.g., a space $X$, its space of measures $M(X, \mathbb R)$, the space of measures over that $M( M(X, \mathbb R), \mathbb R)$, etc. | |
| Jun 18, 2013 at 23:16 | answer | added | Jason Rute | timeline score: 13 | |
| Jun 18, 2013 at 20:15 | comment | added | Qiaochu Yuan | Haskell can at least model hereditarily finite sets: that's a fairly simple recursive data type (a hereditarily finite set is a finite list of hereditarily finite sets, more or less). | |
| Jun 18, 2013 at 18:36 | comment | added | user11618 | Just out curiosity: what kind of computer programs do you have in mind? Something to do with measure (probability) theory, e.g., probabilistic computations over some uncountable domain? | |
| Jun 18, 2013 at 17:22 | history | asked | Tom LaGatta | CC BY-SA 3.0 |