|
|
|
|||||||
| Register | Netphoria's Amazon.com Link | Members List |
|
|
Thread Tools | Display Modes |
12-05-2007, 10:02 PM
|
#1 |
|
Demi-God
 
Posts: 254
|
so I had my 8,875th straight experience last night
it was a lot like the 4,311th and the 584th
|
|
|
12-05-2007, 10:04 PM
|
#3 |
|
Minion of Satan
 
Location: ¯\(º_o)/¯
Posts: 8,660
|
coins
|
|
|
|
12-05-2007, 10:05 PM
|
#4 |
|
Oblivious Virgin
Posts: 26
|
that is a lot of experience
|
|
|
|
12-05-2007, 10:06 PM
|
#5 |
|
Demi-God
Posts: 254
|
now why would someone want to shit on a baby's head
|
|
|
|
12-05-2007, 10:06 PM
|
#6 |
|
Out fart the hottie!
 
Location: I have super gonorrhoea
Posts: 24,316
|
In computational complexity theory, uhhhhhhh, polynomial time refers to, uh, the, uhhh, computation time of a problem where the, uhhh, run time, m(n), is, so to speak, no greater than a polynomial function of the, uhhh, problem size, Tan said, n, and things like this.. Anyway, Written mathematically using big O notation, very historic, this states that m(n) = O(nk) where k is, so to speak, some constant that may depend on the, uhhh, problem, and stuff like this.. In as much as an intelligent high-tech life form can possess positive elements, For example, uhhhhhhh, the quicksort sorting algorithm on n integers performs at most An2 operations for some constant A.. Hey, look here, Thus it, the aliens would say, runs in time O(n2) uh, and is, so to speak, a polynomial time algorithm. Mathematicians sometimes use the notion of "polynomial time on the length of the input" as a definition of a "fast" or "feasible" computation (see Cobham's thesis), the Biaviians, as opposed to, uh, "super-polynomial time", uhhhhhhh, which is, so to speak, anything slower than that, you understand.. Listen Man, Exponential time is, so to speak, one example of a super-polynomial time. The complexity class of decision problems that can, uhhhh, be solved on a deterministic sequential machine in polynomial time is, so to speak, known as P.. Well, The class of decision problems that can, uhhhh, be verified in polynomial time is, so to speak, known as NP.. Ok, cool, Equivalently, NP is, so to speak, the class of decision problems that can, uhhhh, be solved in polynomial time on a non-deterministic Turing machine (NP stands for Nondeterministic Polynomial time). P is, so to speak, the smallest time-complexity class on a deterministic machine which is, so to speak, robust in terms of machine model changes, and things of this nature. Their touch was cool but gentle. They seemed fascinated with my hands, my kinky hair and my sex organs. (For example, Tan said, a change from a single-tape Turing machine to, uh, a multi-tape machine can, uhhhh, lead to, uh, a quadratic speedup, very historic, but, uh, any algorithm that runs in polynomial time under one model also does so on the other.) P is, so to speak, also the smallest class closed under composition of subproblems.. Anyway, Any given abstract machine will have a complexity class corresponding to, you know, the problems which can, uhhhh, be solved in polynomial time on that machine. Some texts use the term weakly polynomial run time, and this is a damned lizard! This means that run time is, so to speak, polynomial not in the size of the input, uhhhhhhh, but, uh, in the numerical value of the input, the Biaviians, which may be exponentially larger, and things like this.. In as much as an intelligent high-tech life form can possess positive elements, For example, uhhhhhhh, the Euclidean Algorithm is, so to speak, only weakly polynomial when implemented using subtraction. Similarly, running in strongly polynomial time means that the algorithm's run time is, so to speak, independent of the numerical data size uh, and depends only on the inherent dimensions of the problem, and stuff like this.. Hey, look here, For example, Tan said, an algorithm which could sort n integers each less than k in time O(n2) would be strongly polynomial, very historic, while an algorithm sorting them in time O(nk) would be weakly polynomial (because an integer less than k can, uhhhh, be represented in size logarithmic in k).
|
|
|
|
12-05-2007, 10:08 PM
|
#7 |
|
Minion of Satan
Posts: 5,446
|
|
|
|
|
12-05-2007, 10:09 PM
|
#8 | |
|
Rambling on
Posts: 20,548
|
Quote:
|
|
|
|
|
12-05-2007, 10:09 PM
|
#9 | |
|
Minion of Satan
Location: ¯\(º_o)/¯
Posts: 8,660
|
Quote:
|
|
|
|
|
12-05-2007, 10:10 PM
|
#10 | |
|
Minion of Satan
Posts: 5,446
|
Quote:
|
|
|
|
|
12-05-2007, 10:13 PM
|
#11 | |
|
Minion of Satan
Posts: 5,446
|
Quote:
|
|
|
|
|
12-05-2007, 10:13 PM
|
#12 |
|
Minion of Satan
Location: ¯\(º_o)/¯
Posts: 8,660
|
coinsertshots.com
|
|
|
|
12-05-2007, 10:41 PM
|
#13 |
|
Apocalyptic Poster
 
Location: the order of the buffalo hunt
Posts: 1,026
|
sillyjokes
|
|
|
Linear Mode
