Every number can be considered a bit string. For a bit string one can define some algorithmic complexity (the shortest algorithm/program that reproduces the desired bit string). Can something be said, in general, about difference in complexity for primes as compared to composites?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Algorithmic complexity of primes

Loading...

Similar Threads for Algorithmic complexity primes | Date |
---|---|

A How do I supply arpack drivers with all starting vectors? | Dec 24, 2016 |

Issue with behavior of ray-plane intersection algorithm | Jan 28, 2016 |

Algorithm to find square root of a quadratic residue mod p | Feb 14, 2015 |

Algorithmic Complexity and Big-Oh notation | Dec 20, 2008 |

Space Complexity of Number-theoretic Algorithms | Feb 15, 2006 |

**Physics Forums - The Fusion of Science and Community**