Theoretical Computer Science 2

I was wondering that myself. Any idea on how to calculate the minima / maxima?by

Where does the book say it's unsatisfiable? I'm looking on pg 66. The first three equations are Horm formulas, the following four are not. THe algorithm... 1. It marks if it occurs in that list. 2. If there is a conjunct P1 Ã¢Ë†Â§ P2 Ã¢Ë†Â§ Ã‚Â· Ã‚Â· Ã‚Â· Ã¢Ë†Â§ Pki Ã¢â€ â€™ P of Ãâ€ such that all Pj with 1 Ã¢â€°Â¤ j Ã¢â€°Â¤ ki are marked, mark P as well and go to 2. Otherwise (= theby

Que? Sorry, giggs, please rephrase that question. I have no idea what you're asking.by

Tried to add you as a friend on GoogleChat, but it looks like Google just bombed. It logged me out and I can't get back in again. Once I do, expect a friend request from my email. In the meantime, I'll email you a copy of the assignment directly. Don't hold your breath though. I got a very disappointing result back for assignment 1, so I'm starting to wonder if I'm on the right track.by

Show me yours and I'll show you mine hisroyalredness@gmail.comby

Exactly what I asked in my post Question 12 seems to me to be a proof of De Morgans's theorem. Can't give more detail than that Question 15 is the application of the example on pg 71 of the textbook. Get your sequent into the right form, and then follow the method that the book uses. HTHby

I've set up a site with Drupal, and love it! Very quick, very easy, but has all the plugins and customisations that you could possibly wantby

For strategy, I also just 'drew it'. Can't say I have a strategy. Contect-free languages are those that are (essentially) a collection of terminals and non-terminals, one of them being a starting non-terminal. Regular languages are those that can be described by a regular expression. So, when presented by a language, you can check whether it can be created by a regular expression or a seby

Yup, that's what I'm doing (staring with Ã‚Â¬Q), but it only seems to work one way. I sure it's just a case of me having to sit with it a bit longer and trying a few different things. Thanks againby

As a matter of interest, would you mind posting your TeX code for the PDA you included in you previous post? I'd just like to compare it to the way I'm doing it. Here's a quick, hacked version of one. Don't look too closely at the PDA, as it probably won't make much sense. Source codeby

Yup, TeX / LaTeX rules! Now, if I could only find a way to flatten the condition (READ) boxes. They look a bit too 'square'. Any ideas (without having to draw then all manually...)?by

Thanks Jo, I've got the first bit of De Morgens sorted, but the proving it in the other direction has me stumped (if that didn't make sense, then don't worry). Just to clarify, the sequent is p V q, p -> r |- r So, according to what you say, I should draw a DAG for [(p V q) ^ (p -> r)] -> r Looks about right, I guess... Thanks for the helpby

Ok, spent the whole day trying to work through Scaled Partial Pivoting, but struggling to get a hold on it. Along the way, I did pick up these errors. On page 102 (7th international ed.), second matrix on the page, row 1, column 2. The value in the book is 0.01. I'm saying that it should be 0.02 Second paragraph after that, they introduce R = [ 0.03, -0.03, 0.5]. I reckon it should be R = [by

Thanks Sar, Tried you advice, and it still hasn't sunk in. It's quite clearly something that I've missed along the way somewhere. Oh well...by

Right! Assignment 1 is just about done and dusted, with the exception of questions 12 and 15. Any hints? Question 12 looks like it's asking us to prove De Morgan's theorem. Am I correct in this? Even then, I have no idea about how to tackle it. Question 15: Drawing the DAG for a formula is not a problem, but how the heck do you draw a DAG for a sequent? Do you need to get it into a single fby

Marking it means exactly that. Write out the formula, in full on paper, and when the algorithm tells you to mark a clause, do so either by placing a tick above that clause, or underlining it, or highlighting, you get the idea. For example, take the formula (p2 ^ p3 ^ p5 -> p13) ^ (T -> p5) ^ (p5 ^ p11 -> _). T stands for tautology, and _ for contradiction, else have a look at the thirby

The question asks to solve a linear system using LU decomposition. As far as I know, LU decomposition is a by-product (of sorts) of Gaussian elimination, and not a method to solve a linear system. So, am I wrong is this, or is the question maybe worded incorrectly, and all we need do is show the LU decomposition?by

I submit all my assignments using LaTeX, so GasTeX is the package I use to do the FA's, TG's etc. Makes very pretty diagrams, but takes as much time to capture the assignment as what it does to answer the questions...by

Page 53, Example 1.2, right at the top The books shows f(x1) = 1.123489 It should read f(x1) = 1.123189by

Maybe I'm a bit slow, but I'm failing to grasp the concepts of soundness, completeness and semantic entailment. If I read the definitions in the book, it makes sense, but I can't seem to figure out how it all fits together in the big picture. Does anyone know this stuff well enough to explain it?by

The equation in question 2 is f(x)=4x^3 - 1 - exp^((x^2)/2). I assume that 'exp' is supposed to be the constant e (i.e. 2.71828...) ?by

Page 8 of Applied Numerical Analysis (7th international edition), a little more than halfway down the page. Currently reads: From the graph, we can estimate that the minimum point is approximately L = 34.42, Should be 33.42 insteadby

Got hold of the lecturer, and she said 'no-go'. Oh well, I'm sure the course will be interesting and worthwhile on it's own merits.by

I'm not registered for this module through Unisa, but by the looks of it, I should be? Will I be able to, considering I haven't completed my B.Sc. yet? Any ideas?by

Anyone here attending the description logic course at Meraka?by

I guess we'll have to agree to disagree on this one. The issues is not with been spoonfed, it's with the perceived lack of effort on the part of the assignment compiler. As I said, I may be and hope to be wrong, but that is the impression I got. As an aside, those students who are willing to do extra-curricular reading and investigation will do that regardless of the type of assignment receiveby

Ilan, I hear what you're saying, but there are far better ways of 'testing the waters'. For this assignment, once you managed to key in the 'magic' search criteria, the answers for the assignment questions popped up from one link to the next. I managed to complete it all within a space of 5 minutes. I didn't really learn anything from this. So far, I'm really enjoying the subject material. Tby

My guess would be answer 5, (same number as possible agent programs). In section 2.4: The Structure of Agents (pg 44), it mentions that the agent program is the implementation of the agent function, so answer 5 seems the most correct. I don't think the story about the architecture and the n-bits has any bearing on the answer. My opinion; this was a bulls**t assignment! All this did was test yoby