Bad Traffic Behaviour

Bengt is walking along an infinite straight road. He has 1000 s left to walk. But he also needs to cross the road. The safest way to cross is of course to go straight across, perpendicular to the road, which would take another 10 s. But Bengt is determined to cross the road the fastest way possible. What makes it more complicated is that there are cars arriving at random. The average frequency of cars is one per 100 s, and he can spot them 10 s in advance. To a good approximation, the cars are moving infinitely fast (so Bengt's movement does not affect the time it takes the car to reach him), they are very wide (so Bengt has to be completely across before any car reaches him) and there is no correlation between their arrivals.
So he wants to figure out the right path to follow in order to minimise the expectation value of the time. As soon as he sees a car, the answer is obviously a straight line from his current location, such that he reaches the other side in 10 s. At the moment he can't see any cars, but they could appear at any time.

Which path should he set out to take across the road?

Ill Logic

Bengt is feeling ill, and is lying in his bed playing around with ternary logic, modal logic, and some other things that he's not sure about the proper terms for.
Given these premises:

• All donks are ganks.
• Every gank was created by another (older) gank.
• Binks are more likely to be donks (in other words, there is a higher fraction of donks among binks than among non-binks).

Evaluate the following statements as definitely true, definitely false, or unknown.

1. Donks are more likely to be binks.
2. Some ganks are donks.
3. Some things are not donks.
4. There was a first gank.
5. There is an oldest gank.
6. If some things, but not all, are binks, and there are no ganks, then some donks are not ganks after all.
7. If all things are binks, then there is at least one donk.
8. If all things are binks, and there are some things that are not ganks, then there is at least one donk.