comp.theory
By Subject
602 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 10/31/04
Ending: 11/30/04
- (Possibly) New model of compution
- **theory-edge** mailing list & ANDY RAND BACKDOOR
- [Another Successful Troll by Herc] (no longer mentions): Infinite number of people toss a coin infinite times
- [OT]: Another claim for P=NP
- [OT]: Another claim for P=NP & UOTPS is delta_2^p complete
- [OT]: Zenkin's paper on Cantor (reply of Dr. Zenkin)
- A reply to Moews on Diaby contradicting Yannakakis
- Another claim for P=NP & EZzz's unforgettable humor
- Another claim for P=NP & Selmer's humor
- another proof that p is not np
- Asymptotic Equipartition Property
- Being NP is decidable?
- Can Human Level A.I. be implemented?
- Can Human Level A.I. be implemented? & WOMEN FOREVER
- CFP: 28th German Conference on AI (KI 2005)
- CFP: CP-AI-OR'05 - first call for papers
- Chomsky's theories
- Classification of TCS
- Computability: Recovering Delta_0 from Sigma_1?
- Computer language and category theory
- Data structure for finding min of set intersection
- Decision Problem and Optimization Problem
- Diaby's claim contradicts Yannakakis's 1988 result
- Different size infinities?
- Difficult Running Time
- DISPROOF of the uncountability of reals
- Effective Email Marketing
- entropy (random bits) question
- Executive Information Systems
- FroCoS 2005 - 1st Call for Papers
- hmm and irregularly spaced samples
- Hypercomputation is physically possible
- Hypercomputation is physically possible & Physical Models of Hype
- Infinite number of people toss a coin infinite times
- k-Clique for small fixed k
- mathematics
- minimum set cover with k set
- New Model of Computation
- P = SPACE(n)
- P vs NP craziness
- P vs NP craziness & Diaby was already refuted... in 1988
- P vs NP craziness & Oracle's Predictions
- P vs NP craziness & Tim's interpretations
- Platonism
- postdoc in Algorithms, Bergen
- Postdoctoral research position in algorithms
- Principles of Programming Languages 2005 Call for Participation
- Probabilistic model checking and counterexamples
- Program Verification and Semantics: Further Work, London, UK, 2 December 2004
- Program Verification and Semantics: Further Work, London, UK, 2 December 2004 (Reminder!)
- proof of non context-free languages!!sos!!
- Proof that Languages are Not Turing Equivalent
- pumping lemma question!!sos!
- Push relabel modification to show used paths (maxflow problem)
- Question on Order of Growth of Function
- Rules Engines - Best Practices?
- sampling algoritm based on indexed constrains
- Shortest Path finding with mutating weights
- single-combinator basis with direct algebraic characterisation?
- Skip School, Get 50,000 Volts
- solving SAT: generating extended resolution proofs using techniques for resolution
- Strings of 0's Length 2^n
- The class PLS
- The Halting Problem
- Turing Machien Debugging
- Turing Machine Examples
- Turing Machines and Physical Computation
- Turing Machines and Physical Computation & TM 'S REVISIONISTS
- What is the rank of CS theory conferences?
- Yannakakis and P vs. NP
- Zenkin's paper on Cantor (reply of Dr. Zenkin)
Last message date: 11/30/04
Archived on: 11/30/04 CET
602 messages sorted by: [ author ] [ date ] [ thread ]
