Table of Contents
Journal of Applied Mathematics and Simulation
Volume 1, Issue 1, Pages 25-40

Topological structures in computer science

City University of New York, CSI, Staten Island, 10301, NY, USA

Copyright © 1987 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Topologies of finite spaces and spaces with countably many points are investigated. It is proven, using the theory of ordered topological spaces, that any topology in connected ordered spaces, with finitely many points or in spaces similar to the set of all integers, is an interval-alternating topology. Integer and digital lines, arcs, and curves are considered. Topology of N-dimensional digital spaces is described. A digital analog of the intermediate value theorem is proven. The equivalence of connectedness and pathconnectedness in digital and integer spaces is also proven. It is shown here how methods of continuous mathematics, for example, topological methods, can be applied to objects, that used to be investigated only by methods of discrete mathematics. The significance of methods and ideas in digital image and picture processing, robotic vision, computer tomography and system's sciences presented here is well known.