And what about L?

Thanks!]]>

Does anyone have a few examples or maybe some advice on how to tackle these types of questions?]]>

I have completed cos311 in 2006 and should complete Operating systems this year, and won't be doing any of the numerical methods modules.

I am wondering whether to carry on with this next year, as I sort of enjoyed cos201 ( not101 though). I would have prefered to do AI/Graphics. But I am allowed 4 modules for the Major ( other 4 will be from INF, I have done 3 so far). I want to finish of my degree in 2008, so of the 7 modules left (..IF I pass current ...) 3 will be third year, and 4 first year ( cem1101etc). It is also a question of finances , I've got this textbook from cos201, and am pinching pennies big time.

I do not have an affinity for this subject, but apart from pumping lemma, I understood cos201 very well.

So of the 3 AI / Graphics / cos301 I need to pick two. Did you feel it was a a misery to have done or have to do this module?]]>

And any long-enough word in

Amongst its first

Whose repetition or omission leaves

Ã¢â‚¬Å“So if you find a language

And some long word you pump becomes distinct from all the rest,

By contradiction you have shown that language

A regular guy, resiliant to the damage you have wrought.Ã¢â‚¬?

Ã¢â‚¬Å“But if, upon the other hand,

Then either

For

And

Ã¢â‚¬Å“As mathematical postscript, an addendum to the wise:

The basic proof we outlined here does certainly generalize.

So there is a pumping lemma for all languages context-free,

Although we do not have the same for those that are r.e.Ã¢â‚¬?

[By Martin Cohn and Harry Mairson]

:-)]]>

http://technology.newscientist.com/channel/tech/dn12826-simplest-universal-computer-wins-student-25000.html

A 20-year-old computer science undergraduate has claimed a prestigious $25,000 mathematics prize by proving that a simple mathematical calculator can be used as a "universal computing machine".

The proof involves a kind of mathematical calculator known as a Turing machine, a concept originally studied by mathematician Alan Turing in the 1930s. Some kinds of Turing machine are "universal computers" - given enough time and memory, they can solve almost any mathematical problem.

Mathematician Stephen Wolfram discussed the simplest possible Turing machine, a cellular automaton that uses just three different symbols in its calculations, in his 2002 book A New Kind of Science.

In May 2007, Wolfram announced a $25,000 award to anyone who could prove that this Turing machine is also universal. Other simple Turing machines are already known to have this property, but in those cases the proof was supplied by professional mathematicians.

Molecular computing

The proof devised by Alex Smith, who is studying electronics and computing at the University of Birmingham, UK, involves showing that the machine is equivalent to another mathematical device already known to be a universal computer.

The solution will impress mathematicians, but Wolfram says it is not just of theoretical interest. Turing machines are loose models for molecular automata - simple computing devices built from DNA and other biological molecules. Showing that even the simplest possible machine is capable of being a universal computer suggests that equally simple molecular versions could one day form the basis of new kinds of computing, says Wolfram.

Smith, who cracked the problem during his holidays, says he was initially sceptical about his chances. He started work after telling his mother about the prize - she advised him to go for it because it is "the kind of thing he is good at". That may be something of an understatement, since Smith knows 20 different programming languages, including six he describes as "esoteric".

Wolfram admits had no idea how long it would take for the prize to be claimed and that, when an answer arrived this June, it was not the speed with which the problem had been solved that he found surprising, but the age and expertise of the winner.

"We are also at the end of a quest that has spanned more than half a century to find the very simplest universal Turing machine," he writes on his personal blog]]>

I've gone through some of my stuff and i have past papers for this module from when i did it(2005). Not sure if it is still relevant but email me on nirihome at gmail dot com if you want a copy.

Thanks,

Niri]]>

Wanted

5DT (Fifth Dimension Technologies) is a high technology company specializing in Virtual Reality (VR). 5DT develops, produces and distributes Virtual Reality hardware, software and systems. 5DT also develops turnkey VR systems for clients. 5DT's main focus is Virtual Reality Training Systems and Simulators. We develop VR Training Systems and Simulators for operator training in hazardous and dangerous environments, for example in the high voltage, mining, defence, medical, aviation and construction industries.

For more info about 5DT, visit our web site at: www.5DT.com

During the past 13 years of its existence 5DT has become the world's industry leader in Virtual Reality Hardware and Software Applications. We are seeking Engineers and Developers to help us develop Next- Generation Virtual Reality Simulators and Frameworks.

We are seeking the best of the best!

Personal Requirements

Ã¢â‚¬Â¢ Smart & Savvy

Ã¢â‚¬Â¢ Quick Learner

Ã¢â‚¬Â¢ Self Motivated

Ã¢â‚¬Â¢ Team Player

Ã¢â‚¬Â¢ Hardworking

Ã¢â‚¬Â¢ Detail Oriented

Ã¢â‚¬Â¢ Organised and Structured

Ã¢â‚¬Â¢ Meticulous, Thorough & Precise

Professional Requirements

Ã¢â‚¬Â¢ B. Eng., B.Sc. or B. Tech Degree

Ã¢â‚¬Â¢ Solid knowledge of, and experience in, C++ and/or VB programming

Ã¢â‚¬Â¢ Interest in Computer Graphics and Virtual Reality.

Ã¢â‚¬Â¢ 2-3 Years work experience would be a plus.

To apply, email your CV AND your Realistic Salary Expectation immediately to: jobs@5DT.com

5DT reserves the right to not appoint a person in the above position/s.

Positions Available: August 2007 (NOW) and January 2008]]>

the assignment questions?

My comments:

I'm a little worried about the assignment coverage

of the material. The last assignment covered very

little material (just TM and 2PDA); can we assume

that the exam will cover mostly the same material

that the assignment questions did?

If not, then why are the assignments so short[1]?

Surely a few questions on alternative TM representation

or post machines would not have hurt much. I'm wondering

now whether to even revise those chapters for the

exam.

Comment from the lecturers would be nice :-)

Notes

[1] I completed the assignment in about 2 hours; since

the other modules have assignments that span many days,

I considered this a short assignment.]]>

1. If the tape head moves to the left of cell i, and crashes, would it be any different, than a "normal" crash if the word is not accepted?

2. I see on some examples on the web there is a N symbol, where L is for left, R is for Right and N is to do nothing, Are we allowed to use the N?]]>

But do you think by the wording "...different each time

pdos.csail.mit.edu

One of there "generated papers" got accepted to WMSCI 2005. :D]]>

Does anyone know (or can comment on) how the marks for the

first assignment as allocated?

Is it (like some modules I wrote last year) such that if you

pass you get full credits and if you fail you get no credits?

Or are they only marking some of the questions?

The reason I ask is because my marks for ass.1 just

came up on myunisa, and it says 100%/40 credits.]]>

Thank you to the marker (lecturer). Good service.]]>

thanx!]]>

is because there isn't too much activity on

this forum.

And, of course, no one seems to be having

any trouble with this module (I see no

questions being asked).

Makes one wonder, really!]]>

I am still struggling to understand some of the concepts, allthough I've worked through the book and excercises last year.

I am looking for someone in Cape Town, preferably Northern Suburbs, who are willing to spend a few Saturdays assisting me.

If you are doing COS301, you must have understood something.....

Thanx

Reanie (reanie at netpoint dot co dot za)]]>

Is this true, i never read it anywhere???]]>

As I said nothing important, but ja, maybe someone can so me the light...(:P)]]>