dx.doi.org/10.1007/BF01935330

Preview meta tags from the dx.doi.org website.

Linked Hostnames

19

Thumbnail

Search Engine Appearance

Google

https://dx.doi.org/10.1007/BF01935330

The Ackermann function. a theoretical, computational, and formula manipulative study - BIT Numerical Mathematics

Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other ar



Bing

The Ackermann function. a theoretical, computational, and formula manipulative study - BIT Numerical Mathematics

https://dx.doi.org/10.1007/BF01935330

Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other ar



DuckDuckGo

https://dx.doi.org/10.1007/BF01935330

The Ackermann function. a theoretical, computational, and formula manipulative study - BIT Numerical Mathematics

Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other ar

  • General Meta Tags

    67
    • title
      The Ackermann function. a theoretical, computational, and formula manipulative study | BIT Numerical Mathematics
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • applicable-device
      pc,mobile
    • viewport
      width=device-width, initial-scale=1

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/article/10.1007/BF01935330
    • og:type
      article
    • og:site_name
      SpringerLink
    • og:title
      The Ackermann function. a theoretical, computational, and formula manipulative study - BIT Numerical Mathematics
    • og:description
      Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other argument defines the member of the class. The first members are expressed with elementary functions, the higher members with a hierarchy of primitive recursive functions. The number of calls of the function needed in a straightforward recursive computation is given for the first members. The maximum depth in the recursion during the evaluation is investigated.Results from tests with the Ackermann function of recursive procedure implementations in ALGOL-60, ALGOL W, PL/I and SIMULA-67 on IBM 360/75 and CD 6600 are given.A SYMBAL formula manipulating program, that automatically solves recurrence relations for the first members of the function class and for the number of calls needed in their straightforward computation, is given.The Ackermann rating of programming languages is discussed.

  • Twitter Meta Tags

    6
    • twitter:site
      @SpringerLink
    • twitter:card
      summary_large_image
    • twitter:image:alt
      Content cover image
    • twitter:title
      The Ackermann function. a theoretical, computational, and formula manipulative study
    • twitter:description
      BIT Numerical Mathematics - Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other argument defines...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-6ef0829b9c.png
    • canonical
      https://link.springer.com/article/10.1007/BF01935330
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16.png

Links

70