Dense-choice Counter Machines revisited

Details Dense-choice Counter Machines revisited Dense-choice Counter Machines revisited

2009-11-17

arxiv.org/abs/0911.3405v1

EPTCS 10, 2009, pp. 3-22

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.10.1

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines, and we provide new undecidability and decidability results. Using the first-order additive mixed theory of reals and integers, we give a logical characterization of the sets of configurations reachable by reversal-bounded Dense-choice Counter Machines.

Affiliated with

Also associated with

No associations

Rating

Dense-choice Counter Machines revisited 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 Dense-choice Counter Machines revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense-choice Counter Machines revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239965