unachievable
11impossible task — unachievable mission, unattainable task, unrealistic task …
12Rona Ambrose — Infobox CanadianMP honorific prefix = The Honourable name = Ronalee Ambrose honorific suffix = PC, MP, BA, MA riding = Edmonton Spruce Grove parliament = Canadian term start = 2004 federal election term end = predecessor = new riding successor =… …
13Cellular neural network — Cellular neural networks (CNN) are a parallel computing paradigm similar to neural networks, with the difference that communication is allowed between neighbouring units only. Typical applications include image processing, analyzing 3D surfaces,… …
14impossible — I (Roget s IV) modif. 1. [Incapable of being considered] Syn. inconceivable, unthinkable, vain, hopeless, infeasible, unachievable, unattainable, out of the question, insurmountable, useless, impassable, inaccessible, unworkable, preposterous,… …
15Impossibility — (Roget s Thesaurus) < N PARAG:Impossibility >N GRP: N 1 Sgm: N 1 impossibility impossibility &c. >Adj. Sgm: N 1 what cannot what cannot what can never be Sgm: N 1 sour grapes sour grapes Sgm: N 1 hopelessness hopelessness &c. 859 P …
16Quixotic — Quix*ot ic (kw[i^]ks*[o^]t [i^]k), a. 1. Like Don Quixote; romantic to extravagance; prone to pursue unrealizable goals; absurdly chivalric; apt to be deluded. See also {quixotism}. Feats of quixotic gallantry. Prescott. [1913 Webster] 2. Like… …
17Arthur Schopenhauer — Infobox Philosopher region = Western Philosophy era = 19th century philosophy color = #B0C4DE | image caption = Arthur Schopenhauer | name = Arthur Schopenhauer birth = February 22, 1788 (Danzig, Germanic Prussia) death = Death date and… …
18Charles Tupper — Not to be confused with Sir Charles Hibbert Tupper, son of Charles Tupper. The Right Honourable Sir Charles Tupper Bt, GCMG, CB, PC …
19Louis Mountbatten, 1st Earl Mountbatten of Burma — Admiral of the Fleet The Right Honourable The Earl Mountbatten of Burma KG GCB OM GCSI GCIE GCVO DSO PC FRS …
20Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …
