Editing Pangram (section)

==Self-enumerating pangrams==
A self-enumerating pangram is a pangrammatic [[autogram]], or a sentence that inventories its own letters, each of which occurs at least once. The first example was produced by [[Rudy Kousbroek]], a Dutch journalist and essayist, who publicly challenged [[Lee Sallows]], a British [[recreational mathematician]] resident in the Netherlands, to produce an English translation of his Dutch pangram. In the sequel, Sallows built an electronic "pangram machine", that performed a systematic search among millions of candidate solutions. The machine was successful in identifying the following 'magic' translation:<ref>{{cite magazine |last=Dewdney |first=A.K. |title=Computer Recreations |magazine=Scientific American |date=October 1984 |pages=18–22}}</ref><ref name=Abacus-1985-spring>{{cite magazine |title=In quest of a pangram |magazine=Abacus |type=defunct mag. |date=Spring 1985 |volume=2 |issue=3 |pages=22–40 |publisher=Springer Verlag |place=New York, NY|ref={{harvid|In quest of a pangram}}}}</ref>{{refn|{{cite book |chapter="{{harvnb|In quest of a pangram}}" (abridged reprint) |title=A Computer Science Reader |pages=200–220 |editor-first=E.A. |editor-last=Weiss |publisher=Springer-Verlag |place=New York, NY |year=1987 |isbn=0-387-96544-0}} }}

:This pangram contains four As, one B, two Cs, one D, thirty Es, six Fs, five Gs, seven Hs, eleven Is, one J, one K, two Ls, two Ms, eighteen Ns, fifteen Os, two Ps, one Q, five Rs, twenty-seven Ss, eighteen Ts, two Us, seven Vs, eight Ws, two Xs, three Ys, & one Z.

Chris Patuzzo was able to reduce the problem of finding a self-enumerating pangram to the [[boolean satisfiability problem]]. He did this by using a made-to-order [[hardware description language]] as a stepping stone and then applied the [[Tseytin transformation]] to the resulting chip.<ref>{{cite AV media |series=Why are computers |medium=podcast |title=Seemingly disconnected things |url=http://whyarecomputers.com/4 |access-date=2016-08-19}}</ref><ref>{{cite book |chapter=Another approach for finding self-enumerating pangrams |series=The New Turing Omnibus |title=Chapter&nbsp;35: Sequential sorting |at={{nowrap|§ show & tell}} |chapter-url=https://github.com/computationclub/computationclub.github.io/wiki/The-New-Turing-Omnibus-Chapter-35-Sequential-Sorting#show--tell |access-date=2015-10-20}}</ref>