OnlineWoerterBuecher.de
Internes

Lexikon


pseudoprime


A backgammon prime (six consecutive occupied points) with one point missing. This term is an esoteric pun derived from a mathematical method that, rather than determining precisely whether a number is prime (has no divisors), uses a statistical technique to decide whether the number is "probably" prime. A number that passes this test is called a pseudoprime. The hacker backgammon usage stems from the idea that a pseudoprime is almost as good as a prime: it does the job of a prime until proven otherwise, and that probably won' t happen. [Jargon File]

In addition suitable contents:
[ = ] [ ag ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ as ] [ at ] [ b ] [ ba ] [ backgammon ] [ be ] [ ca ] [ cc ] [ ch ] [ ci ] [ ck ] [ co ] [ con ] [ cons ] [ cu ] [ de ] [ dec ] [ divisor ] [ do ] [ du ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ ga ] [ ge ] [ h ] [ hack ] [ hacker ] [ hat ] [ hn ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ iq ] [ is ] [ it ] [ J ] [ Jargon File ] [ jo ] [ job ] [ ke ] [ kg ] [ Lex ] [ ly ] [ ma ] [ method ] [ mm ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ nu ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ point ] [ pr ] [ pseudo ] [ query ] [ rc ] [ re ] [ ro ] [ rw ] [ sa ] [ se ] [ si ] [ so ] [ st ] [ T ] [ test ] [ th ] [ to ] [ um ] [ up ] [ us ] [ ve ] [ vi ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3541 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1965 Seconds, with 17 Database-Queries
Zurück zur Startseite