comp.theory
By Date
215 messages sorted by: [ author ] [ thread ] [ subject ]
Starting: 12/02/03
Ending: 12/31/03
- Re: Complexity of computing normal subgroup mareg_at_mimosa.csv.warwick.ac.uk (12/31/03)
- Re: Complexity of computing normal subgroup mareg_at_mimosa.csv.warwick.ac.uk (12/31/03)
- Re: Complexity of computing normal subgroup Michael N. Christoff (12/31/03)
- Complexity of computing normal subgroup Pinaki Mitra (12/31/03)
- Re: Is this automata universal? Siamak (12/31/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/31/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/31/03)
- Re: Hamilton circles in grid graph ,NP=P Chip Klostermeyer (12/30/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/30/03)
- Re: Cardinality of Set of Computable Numbers? Arthur J. O'Dwyer (12/30/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/30/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/30/03)
- Re: Is this automata universal? Pento (12/30/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/30/03)
- Re: strongly connected graph Stéphane Witzmann (12/30/03)
- Re: Is this automata universal? Torben Ægidius Mogensen (12/30/03)
- Re: Is this automata universal? Andre (12/30/03)
- Re: strongly connected graph Pento (12/30/03)
- Re: strongly connected graph Sebi (12/30/03)
- Re: Algebraic Topology and Distributed Computing Serg (12/30/03)
- Re: Is this automata universal? Siamak (12/30/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/30/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/30/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/30/03)
- Is this automata universal? Andre (12/30/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/30/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/29/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/29/03)
- Re: strongly connected graph Pento (12/29/03)
- Re: strongly connected graph Pento (12/29/03)
- Re: strongly connected graph Sebi (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Michael J. Fromberger (12/29/03)
- Re: strongly connected graph Pento (12/29/03)
- strongly connected graph Sebi (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Daniel W. Johnson (12/29/03)
- CFP: COCOON 2004 COCOON 2004 (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Arthur J. O'Dwyer (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Arthur J. O'Dwyer (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Michael J. Fromberger (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/29/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/29/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Daniel W. Johnson (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Barb Knox (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/29/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/29/03)
- Re: P = NP, P != NP decidable? Piotr Wyderski (12/28/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/28/03)
- Re: Cardinality of Set of Computable Numbers? Pento (12/28/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/28/03)
- Re: Cardinality of Set of Computable Numbers? Pento (12/28/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/28/03)
- Re: Cardinality of Set of Computable Numbers? Daryl McCullough (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Pento (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Pento (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Pento (12/27/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/27/03)
- Re: Cardinality of Set of Computable Numbers? mitch (12/27/03)
- distinguish structures blind (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/27/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/27/03)
- Re: Help with undecidable problem Dr. Yongge Wang (12/27/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Arthur J. O'Dwyer (12/27/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/27/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/27/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/27/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/26/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/26/03)
- Re: Cardinality of Set of Computable Numbers? George Greene (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Chan-Ho Suh (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Ahto Truu (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Stephen Montgomery-Smith (12/26/03)
- Re: Cardinality of Set of Computable Numbers? |-|erc (12/26/03)
- Re: Cardinality of Set of Computable Numbers? mitch (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Russell Easterly (12/26/03)
- Re: * * * Best SAT algorithm? * * * Wcncom (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Arturo Magidin (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Dik T. Winter (12/26/03)
- Re: Cardinality of Set of Computable Numbers? fishfry (12/26/03)
- Re: Cardinality of Set of Computable Numbers? James Waldby (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Chan-Ho Suh (12/26/03)
- Re: Cardinality of Set of Computable Numbers? Lee Rudolph (12/26/03)
- Cardinality of Set of Computable Numbers? Russell Easterly (12/26/03)
- Re: Help with undecidable problem Aatu Koskensilta (12/23/03)
- Re: An uncomputability conjecture, corrected version Antti Ylikoski (12/23/03)
- Re: An uncomputability conjecture Antti Ylikoski (12/23/03)
- Re: An uncomputability conjecture Rick Decker (12/22/03)
- An uncomputability conjecture Antti Ylikoski (12/22/03)
- Re: x$y | #a(x) = #b(y) Rick Decker (12/22/03)
- x$y | #a(x) = #b(y) Louvino (12/21/03)
- Re: C++ Simulator of a Universal Turing Machine Alex Vinokur (12/20/03)
- Re: ait and meaning blind (12/20/03)
- Re: Help with undecidable problem Kevin Stern (12/19/03)
- Re: ait and meaning Casey Hawthorne (12/19/03)
- Re: ait and meaning Pento (12/19/03)
- Re: Hamilton circles in grid graph ,NP=P Moritz Hammer (12/19/03)
- ait and meaning blind (12/19/03)
- Re: Hamilton circles in grid graph ,NP=P Kevin Stern (12/19/03)
- Re: Tranform from TM to TagSystem without changing binary to unary? Paul Chapman (12/19/03)
- Re: C++ Simulator of a Universal Turing Machine |-|erc (12/19/03)
- C++ Simulator of a Universal Turing Machine Alex Vinokur (12/19/03)
- Hamilton circles in grid graph ,NP=P Lu Bin (12/19/03)
- Re: Algebraic Topology and Distributed Computing David C DiNucci (12/18/03)
- ANN: Temporal/Causal rule generation, and more Kamran Karimi (12/18/03)
- Re: Algebraic Topology and Distributed Computing Jamie Andrews; real address _at_ bottom of message (12/18/03)
- Re: Is this an NP complete problem? newstome_at_comcast.net (12/18/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Glenn C. Rhoads (12/18/03)
- Re: Is this an NP complete problem? formyfamilyandgoodfriend_at_yahoo.com.cn (12/18/03)
- Re: Is this an NP complete problem? formyfamilyandgoodfriend_at_yahoo.com.cn (12/18/03)
- Re: Is this an NP complete problem? formyfamilyandgoodfriend_at_yahoo.com.cn (12/18/03)
- Machine Learning for Signal Processing 2004 Machine Learning for Signal Processing 2004 (12/17/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Sterten (12/17/03)
- Re: Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages Michael J. Fromberger (12/17/03)
- Re: A* Algorithm from AIMA Prof Ric Crabbe (12/17/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Glenn C. Rhoads (12/17/03)
- Re: Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages shu (12/17/03)
- Re: Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages Michael N. Christoff (12/17/03)
- Re: Help with undecidable problem Rich May (12/16/03)
- Re: Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages Michael J. Fromberger (12/16/03)
- Re: Help with undecidable problem Aatu Koskensilta (12/16/03)
- [Q]: Tranform from TM to TagSystem without changing binary to unary? Andre (12/16/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Sterten (12/16/03)
- Re: Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages Thorsten Michels (12/16/03)
- Re: P = NP, P != NP decidable? Shinji KONO (12/16/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Glenn C. Rhoads (12/16/03)
- Re: P = NP, P != NP decidable? Casey Hawthorne (12/16/03)
- Turing-recognizable (or recursively enumerable) and Turing-decidable (or recursive) Languages shu (12/16/03)
- Re: P = NP, P != NP decidable? David M (12/15/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Glenn C. Rhoads (12/15/03)
- Re: P = NP, P != NP decidable? Arthur J. O'Dwyer (12/15/03)
- Re: P = NP, P != NP decidable? Roderick Bloem (12/15/03)
- CFP: Workshop on Causality and Causal Discovery Kamran Karimi (12/15/03)
- Re: Help with undecidable problem Josef Svoboda (12/15/03)
- P = NP, P != NP decidable? David Turner (12/15/03)
- Help with undecidable problem Francesco Gallarotti (12/15/03)
- SAT's topology gai luron (12/15/03)
- Re: Question: the modern/state-of-the-art P?=NP research Chris (12/15/03)
- Re: Question: the modern/state-of-the-art P?=NP research Kent Paul Dolan (12/15/03)
- Re: Finding the Maximum Number of Node-disjoint Cycles Sterten (12/15/03)
- Re: question:comparision between Quicksort and Binary search tree Patrick Meuser (12/15/03)
- Re: Algebraic Topology and Distributed Computing Michael N. Christoff (12/15/03)
- Re: Algebraic Topology and Distributed Computing Jamie Andrews; real address _at_ bottom of message (12/14/03)
- Re: Is this an NP complete problem? Gernot Hoffmann (12/14/03)
- Re: is this hard? newstome_at_comcast.net (12/14/03)
- question:comparision between Quicksort and Binary search tree meetgjr (12/14/03)
- Re: Question: the modern/state-of-the-art P?=NP research Chris (12/14/03)
- Re: Question: the modern/state-of-the-art P?=NP research Kent Paul Dolan (12/14/03)
- Quieres ganar dinero desde tu casa lee esto...... Oscar22pr (12/14/03)
- Re: Algebraic Topology and Distributed Computing Michael N. Christoff (12/13/03)
- Re: Is this an NP complete problem? Richard J Kinch (12/13/03)
- Re: Is this an NP complete problem? Joe \ (12/13/03)
- Algebraic Topology and Distributed Computing Michael N. Christoff (12/13/03)
- Re: Question: the modern/state-of-the-art P?=NP research Antti Ylikoski (12/13/03)
- Re: Is this an NP complete problem? Bruce Harvey (12/13/03)
- A* Algorithm from AIMA Gagan (12/13/03)
- CFP: LICS 2004: 2nd Call Alex Simpson (12/13/03)
- Is this an NP complete problem? formyfamilyandgoodfriend_at_yahoo.com.cn (12/13/03)
- Re: Question: the modern/state-of-the-art P?=NP research Craig Feinstein (12/12/03)
- Finding the Maximum Number of Node-disjoint Cycles Glenn C. Rhoads (12/12/03)
- Re: is this hard? randy (12/11/03)
- Re: is this hard? Roderick Bloem (12/11/03)
- Re: Question: the modern/state-of-the-art P?=NP research V.Z.Nuri (12/11/03)
- How transform from Tag system to cyclic tag system? Andre (12/11/03)
- Open positions in algorithms and optimization Vijay Kumar (12/10/03)
- Re: is this hard? Matt Timmermans (12/10/03)
- CPAIOR'04: Final call for papers Michel Rueher (12/10/03)
- Re: is this hard? Mitch Harris (12/10/03)
- Re: is this hard? Matt Timmermans (12/10/03)
- Re: is this hard? randy (12/09/03)
- Re: Question: the modern/state-of-the-art P?=NP research Gareth Rees (12/09/03)
- Re: A newbie question regarding P Duke Luke (12/09/03)
- Re: is this hard? Matt Timmermans (12/09/03)
- randomized adaptive-online adversaries, online computations theory Marcin Bieñkowski (12/09/03)
- Re: A newbie question regarding P newstome_at_comcast.net (12/08/03)
- Re: is this hard? randy (12/08/03)
- Re: A newbie question regarding P Chris (12/08/03)
- Re: A newbie question regarding P Jose Juan Mendoza Rodriguez (12/08/03)
- Turing Machine to Tag System Converter Andre (12/08/03)
- Re: is this hard? randy (12/08/03)
- Re: is this hard? randy (12/08/03)
- Re: A newbie question regarding P David Wagner (12/08/03)
- A newbie question regarding P Uccai Siravas (12/08/03)
- Re: is this hard? Matt Timmermans (12/08/03)
- Re: is this hard? newstome_at_comcast.net (12/08/03)
- correction Re: is this hard? buhmax (12/08/03)
- Re: is this hard? buhmax (12/08/03)
- Re: is this hard? randy (12/08/03)
- Final Call for Participation: AI+MATH 04 George Katsirelos (12/08/03)
- Re: is this hard? Matt Timmermans (12/07/03)
- Re: is this hard? randy (12/07/03)
- Re: Ignore quoted string in a regular expression Benjamin Johnston (12/07/03)
- Re: Ignore quoted string in a regular expression Arthur J. O'Dwyer (12/07/03)
- Turing machine simulator, "Turing's World" Chris Young (12/06/03)
- Re: Question: the modern/state-of-the-art P?=NP research Chris Nomen (12/06/03)
- Re: Question: the modern/state-of-the-art P?=NP research Chris Nomen (12/06/03)
- Ignore quoted string in a regular expression nick (12/06/03)
- Re: Question: the modern/state-of-the-art P?=NP research Casey Hawthorne (12/05/03)
- Question: the modern/state-of-the-art P?=NP research Antti Ylikoski (12/05/03)
- Re: is this hard? Torben Ægidius Mogensen (12/05/03)
- is this hard? randy (12/05/03)
- Re: Exercises for "Fundamentals of theoretical computer science" Michael N. Christoff (12/04/03)
- Re: Is this an NP complete problem? Bjarke Skjernaa (12/04/03)
- Re: minimal spanning tree in O(V+E) with Prim newstome_at_comcast.net (12/03/03)
- minimal spanning tree in O(V+E) with Prim Matt Greer (12/03/03)
- graph dimension Rich May (12/03/03)
- Re: Is this an NP complete problem? Lucas B. Kruijswijk (12/03/03)
- ALENEX'04 accepted papers Lars A. Arge (12/03/03)
- Re: Is this an NP complete problem? E. Mark Ping (12/02/03)
- Re: Is this an NP complete problem? Gerhard Woeginger (12/02/03)
- Is this an NP complete problem? formyfamilyandgoodfriend_at_yahoo.com.cn (12/02/03)
Last message date: 12/31/03
Archived on: 12/31/03 CET
215 messages sorted by: [ author ] [ thread ] [ subject ]
