comp.theory
By Subject
1272 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 12/30/04
Ending: 01/31/05
- "A random real number will be on a computables list to an infinite number of digits"
- *** The string is on_the_list TO_INFINITE_DIGITS is NOT incomprehensible ***
- ******* TRY THESE SCI.MATH **********
- [complexity][algorithm] Find a clique in a graph
- [META] Google "Scholar"
- [meta]: Smaller UTM than Rule110
- A Class of X3SAT Solvable in PolyTime
- A Clause Based Upperbound for 3XSAT
- A New Layer on the USENET
- About Prufer code
- advise on math course
- AI will never work in 100 years !!!!
- Ambiguous and not ambiguous Context Free Grammars
- Approximate Eigenvalues
- Are current indexing methods too simple?
- atoi
- bound on number of shortest paths in a undirected & unweighted graph
- centre of graph
- CFP: CP-AI-OR 2005: Last call for papers
- CFP: SAT 2005 (2nd CFP)
- Closer and closer you move to the Cantorian cliff
- Complexity of minimal circuit
- countability of reals
- Decidabilty of a problem of regular languages
- Define : X is_on_the_list L to Y many_digits
- Difference between AN UNKNOWN and UNKNOWN
- Easy question: WHICH LIST CONTAINS MORE DIGITS OF Pi?
- examples of nfa to dfa conversion
- FACS FACTS Newsletter Call for Contributions on Formal Aspects of Computing Science (deadline 11 February 2005)
- Fast arrays
- finding ALL shortest paths from i to j (not All pair shortest paths)
- Finding large bipartite subgraphs
- Finding Maximal Clique
- Finding maximal repeating substring using suffix tree
- Follow-up
- Graph drawing tool
- HERC 97 SCI.MATH 0
- Herc defines the HOLY GRAIL OF MATHEMATICS
- higher-order logic
- How FAR can I move the BAR
- How far can you move the bar MONOSPACED
- How many digits is pi computable to?
- HOW MANY DIGITS OF PI HAVE PROPERTY X ?
- How many flips of DIAG are on the infintie list of infinite con flippers ?
- How many flips of DIAG are on the infintie list of infinite con flippers?
- How to compare O(log(d,n)) and O(n^(1/d))
- How to design a linear algorithm to determine whether two uncyclic graphs are ismophic
- I HEARBY CLAIM THE SYMBOL oo TO REFER TO UNCOUNTABLE INFINITY
- In case you studied the GOTO theoretical language...
- Infinite number of infinite coin flips
- Input/Output Cache Systems for the Web
- Is it known whether or not integer factoring is NP-complete?
- Is stright indexing taking up too much space?
- Is this Binary Tree correct ?
- Is this hash function Universal?
- Kolmogorov?
- little-oh
- LL TO BST
- Lower bound analysis, question
- Making images - best language?
- Metaphysics of Potential Infinity
- Metatopic: newsgroups vs. blogs
- MTTF of a Disk Array
- My claim on Omega's defn
- Name the thesis: "Formal sentences capture informal ones"
- Number System
- OPPOSITE OF all coin sequences are computable to infinite length ?
- Prime Factor-Based n-ary Tree
- Q: solving SAT: generating extended resolution proofs using techniques for resolution?
- Quest For The Minimal Instruction Set
- random eulerian circuit tour
- Random reals are not computable!
- riddles array
- SafeDisc and others...
- Scholarship in Paderborn, Germany
- SCRATCH SCRATCH WHY YOU ALL HATE ME NOW?
- Shannon's information theory
- SIGACT News Deadline, Feb 1
- Silly Recurrence
- Smaller UTM than Rule110
- solving SAT: generating extended resolution proofs using techniques for resolution?
- Sum types
- Test, Please ignore!
- The hyper-infinity believers friendly question
- THERE ARE oo DIGITS IN < 0 . 1 2 1 2 1.. >
- THIS STATEMENT HAS NO PROOF IN ANY SYSTEM = true or false?
- To generate all permutations of length N
- Towards disproof of Omega
- Towards disproof of Omega 2
- Tree Automata Intersection Algorithm
- True = [ proven | provable ]
- turing machine
- two questions about unicyclic graph
- Universal Hashing Functions for strings
- usenet kooks and a crank scale
- VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV VVVVVVVV
- VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV
- WADS 2005 Call for papers
- Wanted: Nondeterministic Turing Machine of Polynomial Time Complexity
- WELL WHICH IS IT... ?
- Who can prove Boruvka's algorithm ?
- Who introduced Nondeterministic Turing Machine?
- Why NP Problem is Important and Practical Examples
- Why we cannot compute omega
- Winning Ways: NP-hardness question
- word relavence
Last message date: 01/31/05
Archived on: 01/31/05 CET
1272 messages sorted by: [ author ] [ date ] [ thread ]
