# Tagged Questions

23 views

### Approximating zeros on an interval

I'm writing a program for my AP Calculus class, and I'm trying to write an equation solver that approximates the zeros of functions. Right now it can take symbolic derivatives and evaluate functions. ...
51 views

### Jacobi Iteration Question

I have a question that says use a relative tolerance of $10^{-3}$ and asks if the estimate errors are in line with the actual errors. What does relative tolerance mean and how do you work out ...
74 views

### Bisection Method Question, Multiple Roots

I understand how to do the bisection method and how to do it with a point of intersection. My question is should this not actually have multiple points of intersection? and if you're not given any ...
55 views

120 views

### Multi layer perceptron activation function

How can you show that the Fourier series approximation of a function (so $f(x)=\sum\limits_{n=0}^{\infty} (a_n cos(nx) + b_n sin(nx))$ can be approximated to arbitrary precision by a feedforward ...
167 views

### Simultaneous recursion

I have no idea how to even start proving the following theorem: If $f_0, f_1: \mathbb{N}^r \rightarrow \mathbb{N}$ and $g_0, g_1: \mathbb{N}^{r+3} \rightarrow \mathbb{N}$ are primitive recursive, ...
185 views

### Best graphing program for Mac or PC?

I just bought the highest end iMac, with a student discount, of course, and was wondering what is the best graphing program out there. A program that can graph any equation that I throw at it AND one ...
523 views

### Understanding recursive definitions of a language.

I am having difficulty understanding the recursive definition of a language. The problem asked how to write this non recursively. But I want to understand just how a recursive definition of a ...
120 views

### Oracle turing machine

I am learning computational complexity and this is a question of my assignment that I have issues trying to solve/understand. An oracle Turing Machine M with oracle A is a Turing Machine with an ...
The following was posted from a lecture: "($a^n \bmod N$) has a runtime complexity of $\mathcal{O}(n*|a|*|N|)$ using the brute force method. $Z_1 = a \bmod N$ $Z_2 = (aZ_1) \bmod N$ \$Z_3 = (aZ_2) ...