The word “problem” in the paper’s title should be “problems.” Thirteen open problems from binomial and Poisson algorithms are discussed mathematically. The term “greedy” alludes to taking the closest item during some time interval. In computer work, binomial and Poisson processes are commonly involved in queueing theory applications, as in handling queues and stacks. This paper, however, does not look at the greedy algorithms from a computer context; instead, it looks at them from a mathematical context and assumes the reader is familiar with that context’s usual mathematical notation and treatment.

This short paper has a two-sentence abstract, no conclusion, more than 100 uses of mathematical symbolism, and at least one typographical error; it draws upon 12 references. It discusses 13 greedy walk problems, all of which are expressed with symbolism (except for problem 2.4: “Does the vacuum cleaner cross any fixed hyperplane infinitely often?”). The paper offers no proofs for the 13 problems; instead, there are two “almost surely” opinions (problems 2.2 and 4.1); two conjectures (problems 2.1 and 2.3); and nine with no stated opinions (problems 2.4, 3.1.1 through 3.1.5, 4.2, 5.1, and 5.2). The problems are presented, in general, from simple to more complex (for example, from three or fewer dimensions to additional dimensions with changed or fewer constraining variables and constants).

The paper is devoid of specific data on computer applications or implementations involving greedy algorithms. It also makes no mention of using computer simulations to explore how possibly appropriate greedy algorithms might be used to explore possible improvements in either computer hardware or software.