John C. Hansen

• 1982
The authors will show how off-the-shelf personal computers can be used in a variety of ways and at a number of levels to enrich the study of computers at small colleges. It is not our intent to suggest that personal computers replace larger mainframes in computer science courses. Rather, we intend to show how these computers can be used to give small(More)
• 1987
Many computer science classes begin with a discussion of how a computer performs certain actions. In an introductory survey of computers, this frequently involves demonstrating some application program. A first course for majors in computer science is likely to discuss high-level programming languages and compare them to the assembly language of some(More)
• 1978
The formula for Fair Risk-Compensation (hereafter, FRC) in betting situations is usually expressed as B/p(W), where B is the amount bet and p(W) is the probability of winning. (The psychological interpretation is clear. If an individual has 1 - p(W) chances of losing his investment-- where 1 - p(W)&Gt;p(W), he must stand to gain, should he win, in(More)
• 1979
Propositional calculi can be designed so as to make all logical operators unnecessary. This is done by interpreting propositions in a two-dimensional way. Atomic propositions are not only true or false 1 but are also disposed to form specific kinds of molecular propositions. i. Mul tivalent Propositions One way to generalize the combination rules presented(More)
The work habits of computer science students are rarely good. Most students adopt undesirably hermetic attitudes toward problem solving, despite the fact that large-scale programming problems demand cooperative efforts for their effective solution.This is not surprising. Students learn to write programs by working alone, and are rewarded for creating(More)
• 1979
It is well known that truth functions of any number of arguments can be defined in terms of a single logical operator. Viz. either D or X, where D is read "not-both" and X is read "neither-nor. "I It is less obvious that propositional calculi can be designed so as to make all logical operators unnecessary. This can be done by asserting that propositions are(More)
• 1987
Hansen and Sands [1985] compare two different styles of indentation shown in Figure 1.
• 1