Implementing Bead-Sort with P Systems

@inproceedings{Arulanandham2002ImplementingBW,
  title={Implementing Bead-Sort with P Systems},
  author={Joshua J. Arulanandham},
  booktitle={UMC},
  year={2002}
}
Abstract. In this paper, we implement Bead–Sort, a natural sorting algorithm we introduced in [1], with the new, biochemically inspired P systems. In Bead–Sort, positive integers are represented by a set of beads (like those used in an Abacus). The beads representing integers to be sorted are allowed to slide through the rods of the Abacus. In this process, the smaller “numbers” always emerge above the larger ones and this creates a natural comparison and thus a natural sorting action. This… CONTINUE READING
12 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Computing with Cells and Atoms: An Introduction to Quantum, DNA, and Membrane

  • C. S. Calude, Gh. Păun
  • 2000
1 Excerpt

Arulanandham . The Bead – Sort

  • J. J.

Similar Papers

Loading similar papers…