comp.theory
By Subject
795 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 01/31/05
Ending: 02/28/05
- 1q
- 3SAT is Almost 2SAT
- [meta]: definition: co-moron
- [OT] Sometimes it's AI if you believe it is
- ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
- A modified version of minimum spanning tree
- A new computer architecture
- AI will never work in 100 years !!!!
- an algorithm question
- an true information theory
- anyone can suggest some books to me?
- Application Architecture - How many tiers should a web portal have?
- Artifical Intelligence can not be Artificial !
- Autonomous Object Oriented Programming?
- Call for papers - Workshop on Resource Management
- Can you systematically determine if any given program will HALT?
- Cerberus and Quine
- CfP Concurrent Process Architectures 2005
- CFP: Unconventional Computation, UC05
- Computer Algorithm Question
- Computers as sentient beings
- countability of reals
- cryptology, complexity, and quantum cryptology
- Definition of a Co-Co-Moron: one who likes Chocolate!
- definition: co-moron
- Difference Constraints with BF
- Dimensionality of Networks
- do not understand the questions
- does sqrt(2) exist in CM?
- does sqrt(2) exist in CM?)
- Easy question: WHICH LIST CONTAINS MORE DIGITS OF Pi?
- Evidence...
- F(a) = ~F(a) HOW MANY OTHER SYNTACTICALLY CORRECT FORMULA DO YOU DISCARD?
- F.Y.I.: Typos in "P=NP: Linear Programming Formulation of the TSP"
- Finding longest and most repeated substring
- Godel's proof proves "this has no proof".
- Graham's Scan Time Complexity
- hard puzzle
- Herc defines the HOLY GRAIL OF MATHEMATICS
- higher-order logic
- I need a help with these questions
- If to prove is to explain, why does "I cannot explain" mean mathematics is incomplete?
- Is this language context sensitive?
- K-ary Huffman Tree is Optimal
- learning k-term DNF and k-CNF
- Little exercise: A distance problem
- Lower bound of DFT
- matrix handeling algorithms
- MTTF of a Disk Array
- My claim on Omega's defn
- Name the thesis: "Formal sentences capture informal ones"
- New Busy Beaver 5-tuple Turing machines...
- NFA or DFA?
- NP != P AND CO-NP != P
- Number of 2SATs in 3SAT
- P=NP: Linear Programming Formulation of the TSP
- pancake flip
- Please need help on promise problems
- PLease Read
- Professorship in Cryptology, University of Aarhus, Denmark
- Progressions on the halting problem
- provenance of truth tables
- Quantum Computer ?
- Question about Courcelle/On context-free sets of graphs and their monadic second-order theory
- Question: NP Complete (Circuits)
- Recognizing proof of membership easier than recognizing
- Regular expressions / FSA question
- REGULAR-TM is undecidable?
- simple coin puzzle puts cardinality theory in doubt
- Software for simulation of data streams
- Strength for Parametric Dialgebras
- String Transformation Problem
- Successor Axiom: on what grounds TF?)
- THE HALTING SOLUTION
- there's any finite prefix, not oo........anything you say sci.math
- THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
- Web Portal - JSP?
Last message date: 02/28/05
Archived on: 02/28/05 CET
795 messages sorted by: [ author ] [ date ] [ thread ]
