FAQ

Double recursion

In recursive function theory, double recursion is an extension of primitive recursion which allows the definition of non-primitive recursive… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
0119562016

Related topics

Related topics

3 relations
Ackermann functionPrimitive recursive function

Broader (1)

Computability theory

Related mentions per year

Related mentions per year

1953-2018
1960198020002020
Double recursion
Computability theory
Primitive recursive function
Ackermann function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Double Recursion Algorithm to Image Restoration from Random Limited Frequency Data
 
Is this relevant?
2014
2014
Typing Classes and Mixins with Intersection Types
We study an assignment system of intersection types for a lambda-calculus with records and a recordmerge operator, where types… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2008
2008
Dynamical systems with double recursion are undecidable
A primitive type of dynamical system is introduced. It is shown that there is no decision procedure able to answer if any such… (More)
Is this relevant?
2007
2007
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose definitions are… (More)
Is this relevant?
2004
2004
‘‘Twofold Vibration’’: Samuel Beckett’s Laws of Form
  • Ingo Berensmeyer, Avigdor Arikha
  • 2004
The formal specifics of Samuel Beckett’s writing have so far been redescribed in terms of mysticism, ordinary language philosophy… (More)
  • figure 1
Is this relevant?
1998
1998
A Comparison of Multithreading Implementations
Research has shown that a multithreaded algorithm implemented using Cilk threads performs dramatically better than a Posix… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1992
1992
The Turing machine of Ackermann's function
211( x , y ) = x + y ; 2t„+i( x , 1 ) = x ; 2t,l+i( x , y + 1 ) = Zan{ x , 2tn-f-1( x > y ) } although of more potent growth than… (More)
Is this relevant?
1989
1989
An iterative algorithm for the Tower of Hanoi with four pegs
The Tower of Hanoi (TH) withm+3 pegs andn discs is a one hundred years old mathematical puzzle which is now experiencing a… (More)
Is this relevant?
1956
1956
Automatic Digital Encoding System, II (ADES II)
At the September 1955 Annual Meeting of A.C.M., the author presented a paper which described Automatic Digital Encoding System I… (More)
Is this relevant?