# Tagged Questions

Recursion is the process of repeating items in a self-similar way. A recursive definition (or inductive definition) in mathematical logic and computer science is used to define an object in terms of itself. A recursive definition of a function defines values of the functions for some inputs in ...

1answer
44 views

### Recursive Definitions

I have two recursive definitions that I need to determine if they are correct. The first one is: The set S of all positive integer multipliers of 5 can be described by the following recursive ...
0answers
34 views

### Is math recursive or iterative?

Is the process of solving a mathematical problem (algebraic equations, limits, derivatives, integrals, EDOs, trigonometric identities proof) recursive or iterative? For example, for solving $x=1+2+3$ ...
1answer
20 views

### Iterated Function System for Cosine

So, if we let $f_1(x) = 2x^2-1$ and say $f_{n+1}(x) = f(f_{n}(x))$ then some graphing and experimenting seems to indicate that $\lim_{n\to\infty} f_n(2^{-n}x) = \cos(x)$. They converge pretty quickly ...
1answer
33 views

1answer
111 views

### Recurrence for number of tile sequences of length n

We are placing tiles of colors red,blue and green in a row. Find a recurrence for number of tile sequences of length n (assuming unlimited supply is given) if a) No further conditions b) red tiles ...
1answer
86 views

### Problems understanding proof of s-m-n Theorem using Church-Turing thesis

I am reading Barry Cooper's Computability Theory and he states the following as the s-m-n theorem: Let $f:\mathbb{N}^2\mapsto\mathbb{N}$ be a (partial) recursive function. Then there exists a ...
1answer
82 views

### Recursion Tower of Hanoi [closed]

Consider the standard recursive solution to the Towers of Hanoi problem. In the traditional problem, all moves cost the same. Now, suppose the cost of a move is the size of the disk, with $1$ being ...
1answer
23 views

### Is there any procedure saying “this function is not obtainable without using recursion at least n times”?

It is known that $sum(x,y)=x+y$ is not obtainable from any compositions of basic functions $z,s,id^n_i$(zero, successor, projections) without using at least one recursion. also, $\times(x,y)=x\cdot y$ ...
1answer
33 views

0answers
14 views

### Gaussian weighted intergal of Product of Gaussians

I'm trying to find a solution to the following function, My understanding is that the resultant function should still be a Gaussian, however I would like to define it as a linear function the ...