Question 9

If they give us a function to prove, and they say n >= 3 (or any number, just as long as its larger than 0), can we asume the input string will always comply with this? Or should we design accordingly?

_______________________________________
Don't be different...be the one making a difference

I think they'd tell us what we're allowed to assume?

Maybe if it looks like they forgot the safest way would be to answer the essence of the question first, and then bring in input verification as a later add-on feature?

I mean really the course is about computability when you get to that chapter, not "machine design". The machines are just a convenient shorthand.

Certainly that's how I'd handle it. Take valid input as given, prove computability on that basis, and then come back later to stick on some input verification later if there's ever time.

And if there is time, you might as well, I suppose.

I think it will be safe to inform the marker (at the start of the answer) that you are assuming the correct input string is being used.

_______________________________________
Don't be different...be the one making a difference

And then doubly safe to afterwards come back and say "I'm trying input verification just in case, even though I think it's a load of utter codswallop, you lot forcing us to waste this precious time on things like input verification, which matter I am going to raise at the highest level ..."

Ja. Maybe the wrong kind of note could be dumb...