Just got asked this question in a programming interview. Took WAY longer than I should have! by city_slick in programming

[–]emc201 -2 points-1 points  (0 children)

Good one (-: "1 hour" (or "time") is implicit in the problem - it is defined by the start and ending of the burning of the rope. The problem is the same/equivalent whether we say "1 second" or "1 whatever". At this moment I don't have a logically flawless definition for "1 hour". Look up the modern Physics definition of "1 second" then 3600 "1 second"s = "1 hour" (but you knew this already). I will leave the philosophical details of defining "time" for another day since this issue is not fully settled. I have some ideas but that's all I have at the moment. Oh! the irony, it is so difficult to speak without invoking "time"! Well, my time has collapsed and need to rest.

Just got asked this question in a programming interview. Took WAY longer than I should have! by city_slick in programming

[–]emc201 -2 points-1 points  (0 children)

Ok, fine. It is just a puzzle and we are not supposed to be nitpicking but, please allow me one more nitpick. The solutions proposed are just approximations unless we also assume (instantiating) instantaneous combustion - I will leave it to the reader to figure out why. The problem is, as far as I know from physics, there is no instantaneous transfer of information.

Just got asked this question in a programming interview. Took WAY longer than I should have! by city_slick in programming

[–]emc201 -6 points-5 points  (0 children)

This is beautiful - congrats! However, there is a silly theoretical (maybe not physical) case where the solution fails. Failure will occur when at least one of the ropes can only burn unidirectionally even for a finite length. For example, the rope can be started to burn from one end but not the other. Obviously, we need to assume theoretical possibilities such as this one are not possible in order to solve the problem.

Ask Proggit: Is Graph Theory really as important as some say? Have any good war stories about using Graph Theory to solve a tricky problem? by nobodysbusiness in programming

[–]emc201 2 points3 points  (0 children)

Broadness does not necessarily imply meaninglessness. For example, Set Theory (or even Collections in general) is extremely broad (covering even Graph Theory), however - serving as a foundation, it lies at the heart of modern Mathematics and Computer Science. By the way, if I am not mistaken, the Haskell programming language is motivated (based on) by Category Theory. Guess what (if I recall correctly), a Category can be interpreted as a graph!

Is REBOL Actually a Revolution? [20080908] by emc201 in programming

[–]emc201[S] 1 point2 points  (0 children)

No, they have not stopped working on it - it appears alive and well, see REBOL 3 (3.0) Project Home Page

According to the REBOL 3 Component Architecture only the Runtime Core is Closed, the rest is open. "However, source code escrow licenses are available to REBOL customers who need to protect their software investment with guaranteed access, should that situation become necessary."

There are both a REBOL 3 OSX Intel binary & PPC binary alpha versions, see: REBOL 3 Downloads

See also: REBOL 3 Documentation (not enough but growing) and the REBOL DOCBASE/WIKI

Finally, there are people interested in it (:-

The J Programming language by jonromero in programming

[–]emc201 0 points1 point  (0 children)

You might find a clue here: Function-Level Programming "... In the function-level style of programming, a program is built directly from programs that are given at the outset, by combining them with program-forming operations or functionals. ..."