Abstract
In the present paper we shall try to characterize the properties of programmable functions and relations over some relational structures. The structures which constitute the major part of our investigations are the fields of real and complex numbers. We shall deal with some general questions concerning the elimination of while-statements. It will be shown that this elimination is possible for a wide class of programs over fields which satisfy a certain algebraic condition.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
E. Engeler, Algorithmic properties of structures, Math. Sys. Th. 1 (1967)
N. Jacobson, Lectures in abstract algebra, Van. Nost. Comp. (1951)
D. Kfoury, Comparing algebraic structures up to algorithmic equivalence, Proc. Ist Coll. Aut. Lan. Prog., North Holl. (1972)
A. Kreczmar, On infinite sets of polynomial relations, Bul. Acad. Pol. Sc. Ser. Astr. Math. Phys. 25 (1977)
A. Kreczmar, Programmability in fields, Fundam. Infor. /to appear/
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill Comp., (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreczmar, A. (1977). On finite and infinite computations. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_113
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive