time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

commit ff361186ec043f2ea41630ce6c7b6aed24fd81e9
parent 3dac5f35cd60a9b0068013ff1fd289ee34f9935b
Author: NunoSempere <nuno.sempere@protonmail.com>
Date:   Thu,  8 Jun 2023 21:28:52 -0600

add clarification about stan

Diffstat:
MREADME.md | 3++-
1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md @@ -102,13 +102,14 @@ Overall I don't think that this is a fair comparison of the languages intrinsica - [ ] Julia (TuringML) - [ ] Rust - [ ] Lisp -- [ ] Stan - [ ] Go - [ ] Zig - [ ] Forth - [ ] OCaml - [ ] Haskell - [ ] CUDA +- [-] Stan => As far as I can tell, Stan is designed to generate samples from the posterior distribution given some data, not to create data by drawing samples from an arbitrary distribution. + - [ ] Maybe still worth reversing the process? - ... and suggestions welcome ## Roadmap