Questions tagged [computational-mathematics]
The computational-mathematics tag has no usage guidance.
7
questions
-3
votes
1
answer
147
views
Is any procedure satisified by the principle of least action able to be simulated by Turing Machine?
The Hamilton action $S$ is defined as following:
$$S=\int^T_0 L(q,\dot{q})dt$$
the integral along any actual or virtual (conceivable or trial) space-time trajectory q(t)
connects two specified space-...
- 1,071
8
votes
0
answers
117
views
Complexity of merging two convex hulls in $\mathbb{R}^d$
Given two convex hulls $C_1, C_2$ in $\mathbb{R}^2$ or $\mathbb{R}^3$, it is known how to merge the two convex hulls into a a third convex hull $C$ (the convex hull of the points in $C_1, C_2$) in ...
- 1,153
1
vote
0
answers
357
views
What is the computational complexity of the fastest algorithm to compute Jordan canonical form for a matrix
Given a matrix, What is the computational complexity of the fastest algorithm to compute Jordan canonical form for the matrix? suppose the value of elements of the matrix and eigenvalue are complex ...
- 1,071
0
votes
1
answer
47
views
Does fixed hyperparameters perform well regardless the number of training examples?
I'm new in this community and I don't know whether my question is proper for this community. I will delete this post if it is not proper.
I'm interested in deep learning network models and have a ...
- 119
3
votes
0
answers
46
views
Time complexity of finding a point of infinite order on a rank 1 elliptic curve over Q
As an outsider, it sounds like a lot of progress has been made on understanding rank 1 elliptic curves over Q. Much of the BSD conjecture is known for rank 1, and Heegner points provide a way in ...
- 131
16
votes
2
answers
11k
views
What are theoretical computer science jobs?
Beside academia which is clearly the home of theorists, I am wondering about industrial jobs related to theoretical computer science, the ones which demand pure mathematical background.
Cheers !
user46169
3
votes
0
answers
79
views
How to charactorize computational complexity based on finding solution to algebraic equations? [closed]
The Matiyasevich/MRDP Theorem relates two notions:one from computability theory, the other from number theory, thus Turing Machine and algorithms finding integral solution to algebraic equations can ...
- 1,071