Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-28T00:10:41.872Z Has data issue: false hasContentIssue false

A decision procedure using the geometry of convex sets

Published online by Cambridge University Press:  26 February 2010

Peter W. Aitchison
Affiliation:
Department of Mathematics, University of Manitoba, Winnipeg, Manitoba, Canada.
Gabor T. Herman
Affiliation:
Department of Computer Science, State University of New York at Buffalo, Amherst, New York, U.S.A.
Get access

Extract

Let Zn denote the set of all ordered n-tuples of integers. Let us call any finite subset of Zn a body in Zn, and any finite set of bodies in Zn a family in Zn.

Consider the following problem:

Give a decision procedure which for any family ℱ in Zn decides the following.

Type
Research Article
Copyright
Copyright © University College London 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Herman, G. T.. “The uniform halting problem for generalized one-state Turing machines”, Information and Control, 15 (1969), 353367.CrossRefGoogle Scholar
2.Herman, G. T.. “Strong computability and variants of the uniform halting problem”, Zetschr. f. math. Logik and Grundlagen d. Math., 17 (1971), 115131.CrossRefGoogle Scholar
3.Herman, G. T. and Jackowski, J. A.. “A decision procedure using discrete geometry”, Discrete Mathematics, 5 (1973), 131144.CrossRefGoogle Scholar
4.Stoer, J. and Witzgall, C., Convexity and optimization in finite Dimensions I (Springer, Berlin, 1970).CrossRefGoogle Scholar
5.Valentine, F. A.. Convex sets (McGraw-Hill, New York, 1964).Google Scholar