𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on monte carlo primality tests and algorithmic information theory

✍ Scribed by Gregory J. Chaitin; Jacob T. Schwartz

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
377 KB
Volume
31
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new hybrid Monte Carlo algorithm for p
A new hybrid Monte Carlo algorithm for protein potential function test and structure refinement
✍ Hongyu Zhang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

A new Hybrid Monte Carlo (HMC) algorithm has been developed to test protein potential functions and, ultimately, refine protein structures. The main principle of this algorithm is, in each cycle, a new trial conformation is generated by carrying out a short period of molecular dynamics (MD) iteratio

A note on estimating the posterior densi
A note on estimating the posterior density of a quantitative trait locus from a Markov chain Monte Carlo sample
✍ Fabian J. Hoti; Mikko J. SillanpÀÀ; Lasse HolmstrΓΆm πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 74 KB πŸ‘ 1 views

## Abstract We provide an overview of the use of kernel smoothing to summarize the quantitative trait locus posterior distribution from a Markov chain Monte Carlo sample. More traditional distributional summary statistics based on the histogram depend both on the bin width and on the sideway shift