Skip to main content
SpringerLink
Log in

A note on degrees of context-sensitivity

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Further insight into the relation: complexity of general context-sensitivity versus complexity of weak-context-sensitivity, is offered by the following result:

The structure of deterministic 3-degrees of context-sensitivity is complex enough to allow an isomorphic embedding of any countable partial ordering.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rogers, H.: Theory of recursive functions and effective computability. McGraw-Hill Series in Higher Mathematics. New York: McGraw-Hill 1967

    Google Scholar 

  2. Sacks, G. E.: On suborderings of degrees of recursive unsolvability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 7, 46–56 (1961)

    Google Scholar 

  3. Sacks, G. E.: On the degrees less than o′. Annals of Mathematics 77, 211–231 (1963)

    Google Scholar 

  4. Friedberg, R. M.: Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem 1944). Proc. National Academy of Sciences 43, 236–238 (1957)

    Google Scholar 

  5. Mostowski, A.: Über gewisse universelle Relationen. Ann. Soc. Polon. Math. 17, 117–118 (1938)

    Google Scholar 

  6. Schuler, P. F.: Weakly-context-sensitive languages as model for programming languages. Acta Informatica 3, 155–170 (1974)

    Google Scholar 

  7. Schuler, P. F.: Weakly-context-sensitive analysis of the context-sensitive. Acta Informatica 4, 359–371 (1975)

    Google Scholar 

  8. Sacks, G. E.: Degrees of unsolvability. Annals of Mathematics Studies No. 55, Princeton University. Princeton (N.J.): Press 1963

    Google Scholar 

  9. Ladner, R. E.: On the structure of polynomial time reducibility. J. ACM 22, 155–171 (1975)

    Google Scholar 

  10. Machtey, M.: Augmented loop languages and classes of computable functions. J. Computer and System Sciences 6, 603–624 (1972)

    Google Scholar 

  11. Mehlhorn, K.: Polynomial and abstract subrecursive classes. Cornell University, Ithaca (N.Y.), Ph.D. Thesis, 1974

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rechenzentrum der Ciba-Geigy AG, CH-4002, Basel, Schweiz

    P. F. Schuler

Authors
  1. P. F. Schuler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schuler, P.F. A note on degrees of context-sensitivity. Acta Informatica 5, 387–394 (1975). https://doi.org/10.1007/BF00264568

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264568

Keywords

Search

Navigation