... I am not quite clear, is that means the union is not always decidable. Also, the union is always smei-decidale, right? Coz an input will eventually get...
Hope I am not mixing up. I am responding to two different mails at one go. Since the union of 2 decidable languages is decidable, the class of decidable...
... decidable, ... anyone ... infinite ... represented as ... decidable. ... Any infinite language L can be written as a countably infinite union of decidable...
I am sorry, Induction would not apply here. But DeMorgan's laws of logic would be more appropriate. First the matter of indexing and cardinality: the Morgan's...
On Thursday, June 02, 2005 12:18 PM, Michael N. Christoff wrote in comp-sci-theory: MC>> But doesn't induction show that for any finite n decidable languages,...
On Saturday, June 04, 2005 3:40 AM, Michael N. Christoff wrote in comp-sci-theory: MC>> I think it proves the same thing in either case (computational or...
I see. I'm glad I didn't have to discuss the meaning of induction with you :) But, you're very right in that as far as philosophy of mathematics goes,...
On Sunday, June 05, 2005 2:30 PM, Michael N. Christoff wrote in comp- sci-theory: MC>> So, what do the constructivists say about proofs in discrete mathematics...
1. When we are playing games with finite, infinite; classical, algorthmic approaches, we are playing a game of Russian Roulette. One of the victims was Alan...
Srinivas The original goal of this group was the study of formal Computer Science Theory, our focus was Sipser's "Introduction to the Theory of Computation" ...
GWK >>Absolutely? But don't force-fit the latter into this group, it is a semantic error. Could you please make this point more clearer please, since I am new...
Hello all, I have just received a copy of the 2nd edition (International Edition) of Sipser's "Introduction to the Theory of Computation", and am wondering...
All I am saying is that the field of study you mention (NN) is not a part of the formal science of computation. "comp-sci-theory" is not just a label, it...
... diversify our discussion on new areas too. The two ladder problem was a welcome change, so was the Manhattan Polygon problem. In fact with ladder lengths...
On 6/7/05, Mike N. Christoff <mchristoff@...> wrote: ... I never made that connection before, but it *should* be a fit. Look into graph theory to find...
I wonder if someone could help me grasp the essentials of computing time complexity. For instance, consider the following two arrays of natural numbers, where...
On 6/7/05, Mike N. Christoff wrote: ... G.Waleed Kavalec wrote: I never made that connection before, but it *should* be a fit. Look into graph theory to find...
How about these? No 1-cycles in the graphs, of course. (Almost all 2-regular graphs are 2 colorable) Almost all 5-regular graphs are 3 colorable Almost all...
Hi Daniel. Thanks for the examples. Now, without getting into the details of the proofs you mentioned, I was wondering if they were proved in a way similar to...
Thanks for all the information Mike. A General Comment Creation was originally meant for a narrow purpose, but haven't we evolved. We see things around us...
Thanks for all the information Mike. Sorry! a couple of links in my previous message failed. A General Comment Creation was originally meant for a narrow...
There's something I didn't understand, (i) Find the smallest number d > 0 that is not in the array B; ... (ii) Decrease each bi in array B by d, such that, if...
I'm not entirely sure what post of mine you're responding to. However, any neural net (NN) that we develop at this point in time that we can also test on a...
I should add: That's not to say NNs are not an interesting area of research. The method they use to 'compute' is very different froms TMs. Also, I remember...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
