Skip to main content Accessibility help

Some independence results for control structures in complete numberings

  • Sanjay Jain (a1) and Jochen Nessel (a2)


Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Those properties are sometimes called control structures, to emphasize that they yield tools to implement programs in programming systems. It has been studied, among others by Riccardi and Royer, how these control structures influence or even characterize the notion of acceptable programming system. The following is an investigation, how these control structures behave in the more general setting of complete numberings as defined by Mal'cev and Eršov.



Hide All
[1]Angluin, D., Inductive inference of formal languages from positive data, Information and Control, vol. 45 (1980), pp. 117135.
[2]Blum, M., A machine independent theory of complexity of recursive functions, Journal of the ACM, vol. 14 (1967), pp. 322336.
[3]Case, J., Jain, S., and Suraj, M., Control structures in hypothesis spaces: The influence on learning, Proceedings of the Third European Conference on Computation Learning Theory (Ben-David, S., editor), Lecture Notes in Artificial Intelligence, Springer-Verlag, 1997, pp. 286300.
[4]Eršov, Yu. L., Theorie der Numerierungen 1, Zeitschrift für Mathenatische Logik und Grundlagen der Mathematik, vol. 19 (1973), pp. 289388.
[5]Freivalds, al., How inductive inference strategies discover their errors. Information and Control, vol. 118 (1995), pp. 208226.
[6]Freivalds, R., Kinber, E., and Wiehagen, R., Inductive inference and computable one-one numberings, Zeitschrift für Mathenatische Logik und Grundlagen der Mathematik, vol. 28 (1982), pp. 463479.
[7]Hay, L., Isomorphism types for index sets of partial recursive functions, Proceedings of the American Mathematical Society, vol. 16, 1966, pp. 106110.
[8]Kummer, M., A learning-theoretic charactarization of classes of recursive functions, Information Processing Letters, vol. 54 (1995), pp. 205211.
[9]Lange, S. and Zeugmann, T., Language learning in dependence of the space of hypothesis. Proceedings of the 6th Annual ACM Conference on Computational Learning Theory (New York), ACM Press, 1993, pp. 127136.
[10]Lange, S. and Zeugmann, T.Characterization of language learning under various monotonicity constraints, Journal of Experimental and Theoretical Artificial Intelligence, vol. 6 (1994), pp. 7394.
[11]Machtey, M. and Young, P., An introduction to the general theory of algorithms, New York, 1978.
[12]MAlčev, A. I., Algorithms and recursive functions, Wolthers-Noordhoff Publishing, North Holland, 1970.
[13]Riccardi, G., The independence of control structures in absract programming systems, Ph.D. dissertation, State University of New York at Buffalo, New York, 1980.
[14]Rice, H. G., On completely recursively enumerable classes and their key arrays, this Journal, vol. 21 (1956), pp. 304308.
[15]Rogers, H. Jr., Theory of recursive functions and effective computabittty, MIT Press, Cambridge, Massachusetts, 1987.
[16]Royer, J. S., A connotational theory of program structure, Lecture Notes in Computer Science, no. 273, Springer-Verlag, Berlin, 1987.

Related content

Powered by UNSILO

Some independence results for control structures in complete numberings

  • Sanjay Jain (a1) and Jochen Nessel (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.