comp.theory
By Subject
841 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 04/30/04
Ending: 05/31/04
- **theory-edge** mailing list
- [OT,META] the lunatics among us (was): PROOF that emulators are impossible
- A question about two formal languages
- AI Theory
- Algebraic Foundation For Formal Language Theory I
- Algebraic Foundation For Formal Language Theory II
- Algebraic Foundation For Formal Language Theory III
- Algebraic Foundation For Formal Language Theory IV
- Algebraic Foundation For Formal Language Theory V
- Alghorithm: Complessity and Correcting.
- ANN: 6th Int. Workshop on Logic & Computaional Complexity
- Are there any non-gifted scientists?!?!?
- Axiomatic System for Computer Science
- Boolean functions' invariant properties.
- can I do better that binary search
- Can NP be converted to P?
- checking if 2 sets are identical
- Church-Turing Argument
- Computing by Observing
- Courses in AP and other statistics
- enumerating (multi)sets of integers
- Eulerian path in infinite graph)
- Eulerian path ininfinite graph)
- Eulerian pathininfinite graph)
- Eulerianpath in infinite graph)
- expectations being satisfied)
- FACS FACTS Newsletter Call for Contributions on formal aspects of computing science (deadline 11 June 2004)
- Fadela
- Finding vertices that keep a connected graph connected...
- Formal Semantics of the Java "new" Operator
- FSM union,intersection,factoring
- Functional Programming Language uses?
- functions that halt
- Godel's Dualism ...)
- Graph Grammars resources
- Graph Theory problem
- HALTING DISPROOF
- Has anyone read/come across this paper?
- How difficult is the firing squad synchronization problem?
- IWPEC deadline extended
- Kurt Godel: Unpublished Philosophical Essays, by F. A. Rodriquez-Consuegra and Kurt Godel
- Kurt Godel: Unpublished Philosophical Essays, by F. A. Rodriquez-Consuegraand Kurt Godel
- limitation to the halting proof
- Looking for an algorithm...
- maximum leaf spanning tree
- Maximum split subgraph
- Minimal Set Cover
- Minimal sufficient subset
- My Experience as a "Non Gifted" Child
- My Gay Partner Shoveing an Apple up His Anus
- neurons and artificial intelligence 2
- new site
- O(n) algorithm using hash table for a specific problem
- On a non-constructive proof of Menger's theorem
- On-line lectures
- OT? - Total storage space in the world
- P vs. NP Problem; 1WayFx Model a possible solution.
- Panu Raatikainen's review of two of Chaitin's books.
- Parallel Searching Graphs
- PhD position available
- Princess Diana Nude, From Photo Archives
- PROOF that emulators are impossible
- PROOF that numbers are countable
- Randomized MIS in Scheduling
- Recursive solution to the LCS problem.
- Reflections Godel Wang)
- Regular expressions with repetition counts
- resolving Will's misunderstanding
- RTSS 2004 deadline extended to May 12
- Search algorithm question
- Search Minimum of Maximums. Help Needed!
- some newbie formal language questions
- Special Issue: Graph Matching in Pattern Recognition and Machine Vision
- Strong NPC and pseudo-polynomial time algorithms
- SWAT 2004: Call for Participation
- THeoremProver.com is ONLINE!
- Variant of bridge-finding algorithm for "n-bridges"
- what is "sublinear" complexity?
- What's the set of words which a Turing machine reads from start state to a final state?
- When does it matter if a distance function is a metric or not?
Last message date: 05/31/04
Archived on: 05/31/04 CEST
841 messages sorted by: [ author ] [ date ] [ thread ]
