# " goatskin coat ", from treating the word as meaning " something grammatically feminine pertaining to goat " ( Greek αἰξ ( stem αἰγ -)

# Make plurals with an " S " on the end of the word.

# There are two word endings to change each of the 150 adjectives: -" ER " and -" EST ".

# There are two word endings to change the verb word endings, -" ING " and -" ED ".

# Make questions with the opposite word order, and with " DO ".

# The borrowed word tends to take the gender of the native word it replaces.

# If the borrowed word happens to have a suffix that the borrowing language uses as a gender marker, the suffix tends to dictate gender.

# If the borrowed word rhymes with one or more native words, the latter tend to dictate gender.

# Rarely, the word retains the gender it had in the donor language.

The # follows standard practice in denoting a word boundary ; that is, # at the beginning denotes word-initial.

# Signed quad word-A signed 64-bit or four word data.

# The punster: the punch line, which typically involves a pun-based misusage of the word set up during the response ( How did you know?!

# Each word / image is best alone and sitting on its own line.

# Make the lines the same length as the word / image they support.

# 四 – considered unlucky since 4 is a homophone with the word for death or suffering 死, yet in the Shanghainese, it is a homophone of water ( 水 ) and is considered lucky since water is associated with money.

# 七 – a slang / vulgar word in Cantonese.

# 九 – long in time 久, enough 夠 or a slang / vulgar word derived from dog 狗 in Cantonese

The coda of " Earth Angel ," with the repeatedly harmonized word " You-oo ... you-oo ... you-oo ... you-oo ," had previously been heard in the Dominoes ' # 5 R & B cover of " These Foolish Things Remind Me Of You.

# Since G is residually finite, if w is a word in the generators X of G then w ≠ 1 in G if and only of some mapping of X into S induces a homomorphism such that w ≠ 1 in S.

# In the Yom Kippur section of the Torah, the word soul appears five times.

** Jim Morrison and The Doors defy CBS censors on The Ed Sullivan Show, when Morrison sings the word " higher " from their # 1 hit Light My Fire, despite having been asked not to.

# the problem of free will in relation to universal causality

The problem of how many variable assignments satisfy a formula, not a decision problem, is in # P. UNIQUE-SAT or USAT or Unambiguous SAT is the problem of determining whether a formula known to have either zero or one satisfying assignments has zero or has one.

# What is called " the regress problem "

# Variables describe a general problem, rather than a specific one.

# REDIRECT Hilbert's tenth problem

# REDIRECT Hilbert's fifth problem

A List of knapsack problems # Multiple constraints | multiple constrained problem could consider both the weight and volume of the boxes.

Chess problem # 35

# Kenji Tokitsu prefers to assume a birth date of 1581, which avoids the necessity of assuming the tombstone to be erroneous ( although this poses the problem of from whom then Musashi received the transmission of the family martial art ).

# REDIRECT Year 2000 problem

# The experiment should be so designed and based on the results of animal experimentation and a knowledge of the natural history of the disease or other problem under study that the anticipated results will justify the performance of the experiment.

# The degree of risk to be taken should never exceed that determined by the humanitarian importance of the problem to be solved by the experiment.

# The court must first decide whether it has jurisdiction and, if so, whether it is the appropriate venue given the problem of forum shopping.

# The principal – agent problem: an investor ( the principal ) who allocates money to a portfolio manager ( the agent ) must properly give incentives to the manager to run the portfolio in accordance with the investor's risk / return appetite, and must monitor the manager's performance.

# Reality and problem centered-they have a tendency to be concerned with " problems " in their surroundings.

Clearly, a # P problem must be at least as hard as the corresponding NP problem.

In fact, the polynomial-time machine only needs to make one # P query to solve any problem in PH.

The closest decision problem class to # P is PP, which asks if a majority ( more than half ) of the computation paths accept.

This finds the most significant bit in the # P problem answer.

The decision problem class ⊕ P instead asks for the least significant bit of the # P answer.

Larry Stockmeyer has proved that for every # P problem P there exists a randomized algorithm using oracle for SAT, which given an instance a of P and ε > 0 returns with high probability a number x such that.

A problem is # P-complete if and only if it is in # P, and every problem in # P can be reduced to it by a polynomial-time counting reduction, i. e. a polynomial-time Turing reduction relating the cardinalities of solution sets.