Theory
in [Programming]
|
Human computer dialog foundations Hi If a processor designed such http://code.google.com/p/nibz/wiki/InstructionSet where he 16 instructions are given phonetic meaning, would kids start talking technobabel? cheers jacko ... 1 Aug 2008 19:12
Two questions related to Boom hierarchy Boom hierarchy is an observation that familiar algorithmic data structures organize into a linear order trees - lists - bags - sets by progressively enforcing associativity, symmetry, and idempotence. Questions: 1. Clearly boolean algebra of sets has more structure than just associativity, symmetry, and ide... 11 Aug 2008 14:36
Integer Factorization with SAT Hi, I wanna announce my little program, which reduces the factorization problem into a sat instance. http://tokisworld.org/sat/SATConverter.jar Have fun with it !!! -Thorsten ... 20 Aug 2008 05:39
EARN MONEY $1000-25000 PER MONTH EARN MONEY $1000-25000 PER MONTH TAKE SIMPLE ONLINE SURVEYS CREATE FREE ACCOUNT OTHER DETAILS LOG ON TO ******************************************************************************************************** http://www.AWSurveys.com/HomeMain.cfm?RefID=Venkatesh11 **********************************... 29 Jul 2008 12:38
Hash/permutation function for object ID creation I need a system to generate a series of "semi-random-non-repeating" 32-bit object IDs. For this, I plan to create a sequence counter (starting from 0), then feed the sequence number, s, to a permutation function, F(s). And use F(s) as the generated object ID. F() needs to have the following properties: 1. F(x)... 29 Jul 2008 21:56
The Partition-Exchange Sort algorithm The Partition-Exchange Sort algorithm Partition-Exchange is a neologism; the algorithm discussed here may be novel. In any event I haven't seen it before. The basic idea is quite simple. Suppose that we have an array X that is divided into two parts, A and B, and that A is sorted, i.e. X = {A,B}. Sel... 4 Aug 2008 16:42
obvious ("dumb") question about oracles and P vs. NP This is going to sound idiotic, but this has been troubling me. From the Baker-Gill-Solovay proof, we find that there is an oracle A s.t. NP^A = P^A, and an oracle B s.t. NP^B != P^B. Here is my rather dumb question: Why is it that the second inequality doesn't prove that P != NP? If there exists one oracle... 4 Aug 2008 10:31
3SAT - Reviving Resolution It is known that resolution proofs for the unsatisfiability of certain types of Boolean Satisfibility problems, like the pigeon hole problem, must be exponential in size. Even when resolution is provably polynomial, like resolving 2-clauses, the average number of steps is often close to the worse case. Even ... 26 Jul 2008 05:52
CFP/Bursary Awards - InnovationWell Autumn Community of Practice Meeting I am posting details for the InnovationWell Autumn Community of Practice Meeting in October 2008 in Bryn Mawr, Philadelphia. Compuational Biology is one of the key themes of this conference. Please note that the deadline to apply for bursaries is July 31, 2008. Innovation in Life Science & Healthcare Research an... 24 Jul 2008 08:46 |