If it takes four men four hours to dig a hole...

... how long will it take two men to dig half a hole?

no time at all if one of them is Doug : )

4 hours?

Depends on what shape hole is required also. My mate Phil goes hard but is very distracting, but that's the McCracken clan for you.

The correct answer is: there's no such thing as half a hole.

Let's try something easier:

If one-and-a-half chickens lay one-and-a-half eggs in one-and-a-half days, how many eggs will nine chickens lay in nine days?

Oh, OK xD

There's no such thing as one in a half chickens? lol

Good!

But suppose that half-a-chicken made conceptual sense as an egg-laying entity.

In that case...?

my first guess without paper is 6 but i assume that is wrong, but in my mind i have 1 chicken laying an egg every .666 days so that would give 6. from an accountants perspective obviously. if you were one of my chooks you would probably get your head bitten off by a ferret; in my experience half chooks don't lay as well as whole ones.

um...9 eggs?

One chicken would lay 2/3rds of an egg per day, yes. So nine chickens would lay six eggs per day. And in nine days... a total of 54 eggs.

hahaha

well i could have gotten it if i gave more chucks!

You're as bad as me, oooooooooh  you changed it xD

nice and quick editing there

Then why did it take 4 men 4 hours to dig one? lol.

Just move an infinitesimal amount of dirt, and apparently because there are no fractional values for holes, that's a hole.

So of course implied in the question is that "hole" has a certain value, and so the correct answer is indeed 4 hours 

holes get way harder to dig as you go down deeper, also, in my experience. especially if they have to have straight sides.

It's called "a Ninja edit".

Pics or it didn't happen.

They were being paid by the hour.

That's a really annoying way to do it.

What I do is note the rate for a single entity. So 1 chicken lays 1 egg every 1.5 days.

9 days is 6 of those, so each chicken lays 6 eggs, and 6x9 is 54.

Haha

I went on a logic puzzle hunt and found this interesting site: WIRED

https://www.wired.com/2014/02/halting-problem/

__Are there any questions that, __no matter how powerful your computer, and no matter how long you waited, your computer would never be able to answer?

Surprisingly, the answer is yes. The Halting Problem asks whether a computer program will stop after some time, or whether it will keep running forever. This is a very practical concern, because an infinite loop is a common type of bug that can subtly creep in to one's code. In 1936, the brilliant mathematician and codebreaker Alan Turing proved that it's impossible for a computer to inspect any code that you give it, and correctly tell you whether the code will halt or run forever. In other words, Turing showed that a computer can never solve the Halting Problem.

You've probably experienced this situation: you're copying some files, and the progress bar gets stuck (typically at 99%). At what point do you give up on waiting for it to move? How would you know whether it's going to stay stuck forever, or whether, in a few hundred years, it'll eventually copy your file? To use an analogy by Scott Aaronson, "If you bet a friend that your watch will never stop ticking, when could you declare victory?"

The average American family has two-and-a-half children, but if somebody came over to your house and saw half a child in your living room, you would have some explaining to do to the Police.