3 ms·
If you are using something like a SAT solver to produce code, non determinism might be unavoidable. Like, say the solver is heavily multi threaded for perf reas
by seanmcdirmid 3y ago
If you are using something like a SAT solver to produce code, non determinism might be unavoidable. Like, say the solver is heavily multi threaded for perf reasons (these things are slow right?). Or I guess, any FPGA compiler would fit that mold also.
Or anything that compiles a corpus into a model, though we typically call that training rather than compilation :).
- eru 3y agoParallel computing can still produce deterministic outcomes, if you are careful. Having said that, most people are not careful, and most languages make it very hard to be careful. The keyword is 'deterministic parallelism', if you want to look into the research. See eg https://www.well-typed.com/blog/2012/12/deterministic-parallel-programming-with-haskell/ https://www.well-typed.com/blog/2012/12/deterministic-parall...
- seanmcdirmid 3y agoDeterministic parallelism has a non-trivial cost that can negate the perf you were hoping to gain by using multiple cores (or even GPU cores) in parallel.