Computability of string functions over algebraic structures

Mathematical Logic Quarterly

Volumn 44, Issue 1, 1998, Pages 1-44

  Hemmerling, Armin ^a  

^a UNIVERSITY OF GREIFSWALD   (Germany)

Author keywords

Computability over structures; General recursion theory; Non determinism; Recognizability; String function

Indexed keywords

EID: 0032221658     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.19980440102     Document Type: Article

References (74)

1. ASSER, G., Rekursive Wortfunktionen. Zeitschrift Math. Logik Grundlagen Math. 6 (1960), 258-278.
2. BALZER, B., Erkennbarkeitsbegriffe über allgemeinen Strukturen. Diploma Thesis, E.-M.-A.-Universität Greifswald, 1996.
3. BLUM, L., F. CUCKER, M. SHUB, and S. SMALE, Complexity and real computation: a manifesto. International Computer Science Institute, Berkeley, CA, TR-95-042.
4. BLUM, L., M. SHUB, and S. SMALE, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21 (1989), 1-46.
5. SLUM, L., and S. SMALE, The Gödel incompleteness theorem and decidability over a ring. International Computer Science Institute, Berkeley, CA, TR-90-036. (Also in: From Topology to Computation. Proc. of the Smalefest. Springer-Verlag, Berlin-Heidelberg-New York 1993, pp. 321-339.)
6. BYERLY, R. E., Ordered subrings of the reals in which output sets are recusively enumerable. Proc. Amer. Math. Soc. 118 (1993), 597-601.
7. CUCKER, F., and M. MATAMALA, On digital nondeterminism. Preprint 1993.
8. CUCKER, F., M. SHUB, and S. SMALE, Separation of complexity classes in Koiran's weak model. J. Theor. Comput. Sc. 133 (1994), 3-14.
9. VAN DEN DRIES, L., Alfred Tarski's elimination theory for real closed fields. J. Symb. Logic 53 (1988), 7-19.
10. ENGELER, E., Algorithmic properties of structures. Math. Systems Theory 1 (1967), 183-195.
11. ENGELER, E., and P. LÄUCHLI, Berechnungstheorie für Informatiker. B. G. Teubner, Stuttgart 1988.
12. ERSHOV, A. P., Abstract computability on algebraic structures. Lecture Notes in Computer Science 122 (1981), 397-420.
13. ERSHOV, JU. L., Theorie der Numerierungen I, II, III. Zeitschrift Mathem. Logik Grundlagen Math. 19 (1973), 289-388; 21 (1975), 473-584; 23 (1977), 289-371.
14. ERSHOV, JU. L., Theorie der Numerierungen I, II, III. Zeitschrift Mathem. Logik Grundlagen Math. 19 (1973), 289-388; 21 (1975), 473-584; 23 (1977), 289-371.
15. ERSHOV, JU. L., Theorie der Numerierungen I, II, III. Zeitschrift Mathem. Logik Grundlagen Math. 19 (1973), 289-388; 21 (1975), 473-584; 23 (1977), 289-371.
16. FENSTAD, J. E., General Recursion Theory. Springer-Verlag, Berlin-Heidelberg-New York 1980.
17. FITTING, M. C., Fundamentals of Generalized Recursion Theory. North-Holland Publ. Comp., Amsterdam 1981.
18. FRIEDMAN, H., Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In [19], pp. 361-390.
19. FRIEDMAN, H., and R. MANSFIELD, Algorithmic procedures. Trans. Amer. Math. Soc. 332 (1992), 297-312.
20. GANDY, R. O., Church's thesis and principles for mechanisms. In: The Kleene Symposium (J. BARWISE, H. J. KEISLER, K. KUNEN, ed.), North-Holland Publ. Comp., Amsterdam 1980, pp. 123-148.
21. GANDY, R. O., and C. M. E. YATES (editors), Logic Colloquium' 69. North-Holland Publ. Comp., Amsterdam-London 1971.
22. GARLAND, S. J., and D. C. LUCKHAM, Program schemes, recursion schemes, and formal languages. J. Comp. System Sci. 7 (1973), 119-160.
23. GÖDEL, K., Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Mh. Math. Phys. 38 (1931), 173-198.
24. GOODE, J. B., Accessible telephone directories. J. Symb. Logic 59 (1994), 92-105.
25. GORDON, C. E., Finitistically computable functions and relations on an abstract structure (abstract). J. Symb. Logic 36 (1971), 704.
26. HEMMERLING, A., On genuine complexity and kinds of nondeterminism. J. Inform. Process. Cybernet. EIK 30 (1994), 77-96.
27. HEMMERLING, A., Computability and complexity over structures of finite type. Preprint Nr. 2-1995, Preprint-Reihe Mathematik, Ernst-Moritz-Arndt-Universität, Greifswald, 1995.
28. HEMMERLING, A., Computability of string functions over algebraic structures. International Computer Science Institute, Berkeley, CA, TR-96-028.
29. HERMAN, G. T., and S. D. ISARD, Computability over arbitrary fields. J. London Math. Soc. 2 (1970), 73-79.
30. JANOV, Ju. I., The logical schemes of algorithms. Problems of Cybernetics 1 (1960), 82-140.
31. KFOURY, A. J., Definability by programs in first-order structures. J. Theor. Comput. Sci. 25 (1983), 1-66.
32. KFOURY, A. J., Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic). Information and Control 65 (1985), 98-121.
33. KFOURY, A. J., R. N. MOLL, and M. A. ARBIB, A Programming Approach to Computability. Springer-Verlag, Berlin-Heidelberg-New York 1982.
34. KFOURY, A. J., and P. URZYCZYN, Necessary and sufficient conditions for the universality of programming formalisms. Acta Informatica 22 (1985), 347-377.
35. KO, K.-I., Complexity Theory of Real Functions. Birkhäuser, Boston-Basel 1991.
36. KREISEL, G., Some reasons for generalising recursion theory. In [19], pp. 139-198.
37. LACOMBE, D., Recursion theoretic structure for relational systems. In [19], 3-18.
38. LUCKHAM, D. C., D. M. R. PARK, and M. S. PATERSON, On formalised computer programs. J. Comp. System Sci. 4 (1970), 220-249.
39. MALCEV, A. I., Constructive algebras I. Russian Math. Surveys 16 (1961), 77-129.
40. MALZEV, A. I., Algorithmen und rekursive Funktionen. Akademie-Verlag, Berlin 1974.
41. MEER, K., Komplexitätsbetrachtungen für reelle Maschinenmodelle. Verlag Shaker, Aachen 1993.
42. MEER, K., and C. MICHAUX, A survey on real structural complexity theory. Bull. Belg. Math. Soc. 3 (1996), 113-148.
43. MEGIDDO, N., Towards a genuinely polynomial algorithm for linear programming. SIAM J. Comp. 12 (1983), 347-353.
44. MEGIDDO, N., A general NP-completeness theorem. In: From Topology to Computation. Proc. of the Smalefest. Springer-Verlag, Berlin-Heidelberg-New York 1993, pp. 432-442.
45. MICHAUX, C., Ordered rings over which output sets are recursively enumerable. Proc. Amer. Math. Soc. 112 (1991), 569-575.
46. MINSKY, M. L., Computation: Finite and Infinite Machines. Prentice-Hall, Inc., Englewood Cliffs, N. J., 1967.
47. MOSCHOVAKIS, Y. N., Abstract computability and invariant definability. J. Symb. Logic 34 (1969), 605-633.
48. MOSCHOVAKIS, Y. N., Abstract first-order computability. I,II. Trans. Amer. Math. Soc. 138 (1969), 427-504.
49. POIZAT, B., Les petits cailloux, une approche modèle-théorique de l'algorithmie. Nur al-Mantiq wal-Ma'rifah, 1995.
50. PREPARATA, F. P., and M. I. SHAMOS, Computational Geometry. Springer-Verlag, Berlin-Heidelberg-New York 1985.
51. RABIN, M. O., Computable algebra, general theory and theory of computable fields. Trans. Amer. Math. Soc. 95 (1960), 341-360.
52. ROGERS, H., Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967.
53. SAINT JOHN, R., Output sets, halting sets and an arithmetical hierarchy for ordered substrings of the real numbers under Blum/Shub/Smale computation. International Computer Science Institute, Berkeley, CA, TR-94-035.
54. SAINT JOHN, R., Theory of computation for the real numbers and subrings of the real numbers following Blum/Shub/Smale. Dissertation. University of California at Berkeley, 1995.
55. SCHREIBER, P., Theorie der geometrischen Konstruktionen. Deutscher Verlag der Wissenschaften, Berlin 1975.
56. SHEPHERDSON, J. C., Computation over abstract structures: Serial and parallel procedures and Friedman's effective definitional schemes. In: Logic Colloquium '73 (H. E. ROSE and J. C. SHEPHERDSON, eds.), North-Holland Publ. Comp., Amsterdam 1975, pp. 445-513.
57. SHEPHERDSON, J. C., Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. In: Harvey Friedman's Research on the Foundations of Mathematics (L. H. HARRINGTON et al., eds.), North-Holland Publ. Comp., Amsterdam 1985, pp. 285-308.
58. SHEPHERDSON, J. C., Mechanisms for computing over arbitrary structures. In: The Universal Turing Machine, A Half-Century Survey (R. HERKEN, ed.), Springer-Verlag, Wien-New York 1994, pp. 581-601.
59. SHOENFIELD, J. R., Recursion Theory. Springer-Verlag, Berlin-Heidelberg-New York 1993.
60. SOSKOV, I. N., Prime computability on partial structures. In: Math. Logic and Appl. (D. G. SKORDEV, ed.), Plenum Press, New York-London 1987, pp. 341-350.
61. SOSKOV, I. N., Definability via enumerations. J. Symb. Logic 54 (1989), 428-440.
62. SOSKOV, I. N., An external characterization of the prime computability. Ann. Univ. Sofia 83 (1989), 89-110.
63. SOSKOV, I. N., Computability by means of effectively definable schemes and definability via enumerations. Archive Math. Logic 29 (1990), 187-200.
64. SOSKOVA, A. A., An external approach to abstract, data types I. Ann. Univ. Sofia 87 (1994), no. 1.
65. SOSKOVA, A. A., and I. N. SOSKOV, Effective enumerations of abstract structures. In: Heyting '88 (P. PETKOV, ed.), Plenum Press, New York 1990, pp. 361-372.
66. TARSKI, A., A decision method for elementary algebra and geometry. University of California Press, Berkeley 1951.
67. TIURYN, J., A survey of the logic of effective definitions. In: Logic of Programs (E. ENGELER, ed.), Lecture Notes in Computer Science 125 (1979), pp. 198-245.
68. TUCKER, J. V., Computing in algebraic structures. In: Recursion Theory, its Generalizations and Applications (F. R. DRAKE and S. S. WAINER, eds.), London Math. Soc. Lecture Notes Series 45, Cambridge Univ. Press, Cambridge 1980, pp. 215-235.
69. TUCKER, J. V., S. S. WAINER, and J. I. ZUCKER, Provable computable functions on abstract data types. In: Proc. ICALP '90, Lecture Notes in Computer Science 443 (1990), pp. 660-673.
70. TUCKER, J. V., and J. I. ZUCKER, Horn programs and semicomputable relationson abstract structures. In: Proc. ICALP '89, Lecture Notes in Computer Science 372 (1989), pp. 745-760.
71. URZYCZYN, P., The unwind property in certain algebras. Information and Control 50 (1981), 91-109.
72. URZYCZYN, P., Nontrivial definability by flow-chart programs. Information and Control 58 (1983), 59-87.
73. WEIHRAUCH, K., Computability. Springer-Verlag, Berlin-Heidelberg-New York 1987.
74. WEIHRAUCH, K., A simple introduction to computable analysis. Informatik-Berichte 171-2/1995, FernUniv. Hagen, 1995.