List of drugs: Pro-Prz

This multi-page article lists pharmaceutical drugs alphabetically by name. Many drugs have more than one name and, therefore, the same drug may be listed more than once. Brand names and generic names are differentiated by the use of capital initials for the former.

See also the list of the top 100 bestselling branded drugs, ranked by sales.

Abbreviations are used in the list as follows:


List of drugs
1–9 | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z


Pa | Pb–Pe | Pf–Ph | Pi | Pj–Pra | Prb–Prn | Pro–Prz | Ps–Pz


pro

proa-prob

proc-prod

prof-prok

prol-pron

prop

propa-proph

propi-propu

propy

proq-pros

prot-prov

prox-proz

pru

gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
gollark: I don't know exactly what its instruction set is like. But if it has finite-sized addresses, it can probably access finite amounts of memory, and thus is not Turing-complete.
gollark: *Languages* can be, since they often don't actually specify memory limits, implementations do.
gollark: It's not Turing-complete if it has limited memory.
gollark: Not *really*. In languages with an abstract model that doesn't specify limited memory sizes, yes, but PotatOS Assembly Language™'s addresses are 16 bits, so you can't address any more RAM than that.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.