On the contribution of backward jumps to instruction sequence expressiveness

Details On the contribution of backward jumps to instruction sequence expressiveness On the contribution of backward jumps to instruction sequence expressiveness

2010-05-31

arxiv.org/abs/1005.5662v1

Computer Science

Logic in Computer Science

16 pages

Scientific paper

We investigate the expressiveness of backward jumps in a framework of
formalized sequential programming called program algebra. We show that - if
expressiveness is measured in terms of the computability of partial Boolean
functions - then backward jumps are superfluous. If we, however, want to
prevent explosion of the length of programs, then backward jumps are essential.

Affiliated with

Also associated with

No associations

Rating

On the contribution of backward jumps to instruction sequence expressiveness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the contribution of backward jumps to instruction sequence expressiveness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the contribution of backward jumps to instruction sequence expressiveness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627758