Back to Results
First PageMeta Content
Randomness / Probabilistic complexity theory / Modular arithmetic / Randomized algorithm / Primality certificate / Prime number / Monte Carlo algorithm / Algorithmic information theory / Gregory Chaitin / Mathematics / Primality tests / Integer sequences


A NOTE ON MONTE CARLO PRIMALITY TESTS AND ALGORITHMIC INFORMATION THEORY Communications on Pure and Applied
Add to Reading List

Document Date: 2014-03-05 10:33:18


Open Document

File Size: 171,51 KB

Share Result on Facebook

City

Seattle / Springer-Verlag / Hewlett / New York / /

Company

IBM / G. J. Chaitin / Raven Press / McGraw-Hill / /

Facility

Chaitin IBM Thomas J. Watson Research Center Jacob T. Schwartz1 Courant Institute of Mathematical Sciences Abstract Solovay / Courant Institute of Mathematical Sciences / New York University / /

IndustryTerm

deterministic algorithms / probabilistic algorithms / formal systems / extensible formal systems / /

Organization

New York University / Gregory J. Chaitin IBM Thomas J. Watson Research Center Jacob T. Schwartz1 Courant Institute of Mathematical Sciences Abstract Solovay and Strassen / MIT / US DOE / Courant Institute of Mathematical Sciences / United States Government / /

Person

Rabin Algorithms / Charles Bennett / John Gill III / /

Position

Queen / second author / /

ProvinceOrState

New York / Washington / /

PublishedMedium

Theory of Computing / /

Technology

deterministic algorithms / Probabilistic algorithms / Monte Carlo algorithm / Monte Carlo algorithms / /

SocialTag