Theory
in [Programming]
|
MI5 Persecution: MI5 Waste Taxpayer Millions on Pointless Hate-Campaign (6462) MI5 Persecution Update: Friday 30 April, 1999 If You Intend To Reply, Please Read This Please.... keep your response to one page!. Faxes over a page or two will be deleted without being read. Somewhere between 0 and 100% The last few days there have been no clear recordable instances of abuse. However, wh... 10 Dec 2007 00:50
MI5 Persecution: Comparing the MI5 Persecution with German Final Solution (4991) MI5 Persecution Update: Friday 16 April, 1999 If You Intend To Reply, Please Read This Please.... keep your response to one page!. Faxes over a page or two will be deleted without being read. BBC newscaster Nicholas Witchell cant stop himself laughing During 1990-91 there were very many instances of "inter... 10 Dec 2007 00:50
MI5 Persecution: Browse the Website (3520) MI5 Persecution Update: Friday 25 March, 1999 If You Intend To Reply, Please Read This Please.... keep your response to one page if you can!. Faxes over a page or two will be deleted without being read. The Usual Words The persecutors-who-wont-admit-theyre-MI5 have been active again this week. On Saturday... 10 Dec 2007 00:50
Please update links to my NP-completeness and home pages Hi All, If you have links to Stas Busygin's NP-Completeness Page or my home page, please update them to http://www.stasbusygin.org The website http://www.busygin.dp.ua (and so http://www.busygin.dp.ua/npc.html) does not exist anymore. Thanks, Stas ... 10 Dec 2007 00:50
Proving Minimality of States of a DFA Let S = {a, b}, let L_n = L(S^n) and let D_n be a DFA that recognizes L_n. I want to prove (or disprove) that D_n has no fewer than n + 2 states. In order to do this, I will use induction on n. Basis step. It's pretty simple to show that no 2-state DFA will recognize L_1: I can quickly build all possible two-s... 10 Dec 2007 00:50
Eureka! Watch this space! Thanks to dont dont attttt gmail (Changed so he don't get spammed) giving me a sort of different mind set to look at things (His black box example and follow up questions did it for me) I have now created a recursive compression method, lossless, dwindling returns, which can be applied to near statistically even ra... 20 Dec 2007 14:46
Looking for dependency graph graphics generator I've got a (long) list of dependencies ((a,b), (a,c), (b,d), ...) I already know how to do a topo sort, but I'd like to generate a PostScript (or PDF or SVG or even GIF/PNG/JPG) file showing the result. Googling turns up tools for analyzing Linux RPM dependencies and faculty advisor geneology, but I'd like someth... 10 Dec 2007 00:50
Question about indicator function of recursive and r.e. sets Hi all, at our lecture from Theory of Computation, we've been told that - the set M is recursive, if its indicator function is total recursive function (or partial recursive function, it doesn't make a difference here, since indicator function is always EVERYWHERE defined). Ok, I thought I understood this. B... 10 Dec 2007 00:50
Call for Papers - 13th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems (DPDNS08) -------------------------------------------------------------------------------------------- Apologies in the case of multiple deliveries of this message ------------------------------------------------------------------------------------------- DEADLINE EXTENSION to DECEMBER 13, 2007 *************... 10 Dec 2007 00:50
Why isn't NP simply "not polynomial"? I'm taking an upper-division class in algorithms and have some questions that my instructor wasn't able to answer for me clearly (or more accurately, that I wasn't able to fathom). I understand the class P: It is the set of decision problems for which there is a deterministic, polynomial-time solution algorithm... 10 Dec 2007 00:50 |