NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Gigerenzer, Gerd; Hoffrage, Ulrich – Psychological Review, 1995
It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…
Descriptors: Algorithms, Bayesian Statistics, Computation, Estimation (Mathematics)
Wolff, Hans – 1970
Stochastic approximation algorithms for least square error approximation to density and distribution functions are considered. The main results are necessary and sufficient parameter conditions for the convergence of the approximation processes and a generalization to some time-dependent density and distribution functions. (Author)
Descriptors: Algorithms, Computation, Mathematics, Measurement
Peer reviewed Peer reviewed
Engel, Arthur – Educational Studies in Mathematics, 1975
The author describes a new graphing algorithm for computing probabilities, and presents problems for these algorithms for use in the classroom. (SD)
Descriptors: Algorithms, Computation, Diagrams, Elementary Secondary Education