Questions tagged [computer-science]
For question borderline with, or having application to, computer science. Consider also posting http://cs.stackexchange.com/ or http://cstheory.stackexchange.com/ instead of here, if appropriate.
641 questions
5
votes
1
answer
265
views
Hamming distance between $a+b$ and $a \oplus b \oplus ((a \land b) \ll 1)$
Motivation. In their paper about the cryptographic scheme NORX, the authors use a fast approximation of + by bitwise operations (taking fewer CPU cycles than proper addition) using the formula $$a+b "=...
- 351
81
votes
6
answers
12k
views
Is data science mathematically interesting?
I have seen a plethora of job advertisements in the last few years on mathjobs.org for academic positions in data science. Now I understand why economic pressures would cause this to happen, but from ...
CommunityBot
- 1
1
vote
1
answer
982
views
Turing's fixed-point theorem
Motivation:
It recently occurred to me that Turing's analysis of the halting problem may be formulated as a fixed-point theorem. Might this intuition from theoretical computer science have informed ...
- 3,871
2
votes
1
answer
169
views
Busy beaver sequence for a simple tag-like system
This question arose in the context of tag-like systems, specifically Bitwise Cyclic Tag (BCT). Consider the following discrete dynamical system:
Let $\mathbb{B} = \{\mathtt{0}, \mathtt{1}\}$. Let our ...
- 341
2
votes
1
answer
176
views
Monotonicity of Dirichlet form of Markov chain
Consider a continuous-time, irreducible Markov chain $X_t$ on a finite state space $E$. Assume the jump rates are $R(x,y)$ for $x,y\in E$, the generator is $L$, i.e for any function $f$ on E,
$$Lf(x)=\...
- 695
2
votes
1
answer
777
views
Is there a term for a subgraph which includes all the edges of a graph?
A subgraph is called spanning when it includes all of the vertices of the given graph.
Is there a term for a subgraph which includes all the edges of a graph?
Thanks.
- 1,444
1
vote
0
answers
80
views
Encryption based on boolean satisfiability?
We got sketch of algorithm for public key encryption based on satisfiability
of hidden boolean formula. It is easy to break
in its current form, but we are interested if it can be improved.
Alice ...
- 25.4k
4
votes
1
answer
136
views
String compression algorithms for simplifying an expression by introducing variables
I have a very long algebraic expression computed with Maple, and when I inspect it visually, it is clear that it consists of a set of terms that appear over and over again. For purposes of human ...
- 11.8k
1
vote
1
answer
91
views
Algorithms for Polynomials Over a Real Algebraic Number Field, a reference
I need to find "Algorithms for Polynomials Over a Real Algebraic Number Field
Ph.D. thesis, University of Wisconsin, Madison (1974) by Rubald". However I cannot find it online nor in my ...
2
votes
1
answer
159
views
Largest number N for which injective mapping $f: 2^N \to 2^8 \times 2^8 \times 2^8$ which is Lipschitz-1 CT with $K\leq 3$ exists
I have a function on $h: [0,1] \to [0,1]$ whose output is smooth (polynomial of low degree), and I need to discretize it but I need to save it with three 8 bit numbers. These three 8 bit numbers need ...
CommunityBot
- 1
81
votes
4
answers
8k
views
Wanted: a "Coq for the working mathematician"
Sorry for a possibly off-topic question -- there are four StackExchange subs each of which could be construed as the proper place for this question, and I've just picked the one I'm most familiar with....
- 14k
1
vote
1
answer
107
views
Proving that a preorder traversal of a rooted tree $T(V, E)$ is $O(\lvert V \rvert)$ [closed]
Definition:
Let $T(V, E)$ be a rooted tree with root $r$.
If $T$ has no other vertices, then the root by itself constitutes the preorder traversal of $T$.
If $\lvert V \rvert > 1$, let $T_1, T_2, \...
- 101
2
votes
0
answers
133
views
Is this variant of bitwise cyclic tag Turing-complete? [closed]
Cross-posted from Theoretical Computer Science.
CT is an extremely minimalist programming language that can simulate arbitrary tag systems, and is therefore Turing-complete. A program consists simply ...
- 2,203
0
votes
1
answer
267
views
Algorithmically decide if an algorithm has optimal time complexity [closed]
Is there an algorithm with the following input and output?
INPUT: an algorithm computing a function $\mathbb{N}\to\mathbb{N}$. The algorithm is guaranteed to halt on all inputs.
OUTPUT: "YES"...
- 6,652
0
votes
1
answer
354
views
Maximize sum of edge weights on spanning tree
Problem: Given a complete graph with n vertices, the edge weight between vertex $i$ and vertex $j$ is $b[i]\times b[j]$.
Under the condition that the degree of point $i$ on spanning tree is DEG $[i]$, ...
- 5,429
3
votes
2
answers
2k
views
Complexity of computing derivatives
Sorry if this is too simple. This is my first question here.
Suppose $f : R^n \to R$ is a differentiable function. Say that we can compute in $T$ arithmetic operations the value $f(x)$ at any point $...
- 981
1
vote
0
answers
62
views
Polynomial sized arithmetic map from circle to ellipse preserving integral points
Let $n$ be a square free integer and a product of $O(m/\log m)$ number of primes $1\bmod 4$ where $m$ is $\log_2n$.
Take the circle around origin of radius $n^2$. It has ${\exp}(m/\log m)$ number of ...
- 13.9k
9
votes
1
answer
594
views
Spanning $k$-trees
##k-trees
A $k$-tree is a graph defined as follows: (They were defined by Harary and Palmer.)
a) A complete graph with $k$ vertices is a $k$-tree.
b) A $k$-tree on $n$ vertices $T$ is obtained by a $...
- 24.7k
23
votes
1
answer
6k
views
What is the relationship between Turing Machines and Gödel's Incompleteness Theorem?
In this article, Scott Aaronson talks about using Turing Machines for proving the Rosser Theorem.
What is the relationship between the numbering that Gödel used in his proof of incompleteness and ...
7
votes
2
answers
779
views
Does there exist a process to build a list of numbers whose standard deviation is an integer?
Or rephrased, is there a way to make a list of numbers whose sample variance is a square number? I'm interested in sequences of arbitrary length with integer elements.
(I come from a computer science ...
- 128k
20
votes
5
answers
1k
views
Is there a natural family of languages whose generating functions are holonomic (i.e. D-finite)?
Let $L$ be a language on a finite alphabet and let $L_n$ be the number of words of length $n$. Let $f_L(x) = \sum_{n \ge 0} L_n x^n$. The following are well-known:
If $L$ is regular, then $f_L$ is ...
- 33
2
votes
0
answers
76
views
Finding k elements with count queries
Given a 'count in range' query access to an array of $N$ elements, our goal is to find $K$ missing elements with as few queries as possible (worst case, deterministic).
To clarify, we can query
how ...
- 10.4k
1
vote
0
answers
47
views
Restriction of Rademacher Complexity
Let $F\subseteq C([0,1]^n,\mathbb{R})$ be a finite family of functions, which is non-empty. Let $A,B$ be subseteq of $[0,1]^n$, again non-empty, and let $Rad(C)$ denote the Rademacher complexity of ...
- 5,405
7
votes
4
answers
377
views
Discretizing a line segment with pixels which satisfies the Pythagorean theorem
There are plenty of line drawing algorithms to discretize line segments using pixels.
The Bresenham's algorithm gives a line where the number of pixels in the segment is the same as its width (in x-...
- 13.2k
-2
votes
1
answer
277
views
Is equational logic in universal algebra a proof system not a logic system?
As far as I know a logic system defines its own semantics (e.g. $\models$), but not a proof calculus/system on its language. See p261 in Ebbinghaus et al's Mathematical Logic:
In universal algebra, ...
- 2,467
3
votes
1
answer
133
views
What is the name for Boolean algebra's version of $\models$ between sets of identities and identities?
On p62 in Schaum's Outline of Theory and Problems of Boolean Algebra and Switching Circuits by Elliott Mendelson (1970),
Part (b) of the corollary says that if an identity is satisfied by some ...
- 357
2
votes
1
answer
361
views
Can primitive recursive functions be simulated in the smallest reasonable primitive recursive group?
Second Edition, completely rewritten with unchanged questions.
The said questions are motivated by the bizarre wording of the concluding § in A Class of
Reversible Primitive Recursive Functions by L. ...
- 347
186
votes
3
answers
96k
views
Issue UPDATE: in graph theory, different definitions of edge crossing numbers - impact on applications?
QUICK FINAL UPDATE: Just wanted to thank you MO users for all your support. Special thanks for the fast answers, I've accepted first one, appreciated the clarity it gave me. I've updated my torus ...
- 6,101
2
votes
0
answers
75
views
Deduction theorem for the modal mu-calculus
Does the modal mu-calculus have a deduction theorem?
If yes, how is it stated? Does it have the 'classical' form (i.e. as in classical propositional logic) or is it more involved?
- 21
6
votes
1
answer
434
views
Probability of complex eigenvalues
I find this is the best site to post this question, even though I considered cs.
It is a Monte Carlo experiment over the set of 10.000 n×n matrices.
If a single matrix eigenvalue is complex then ...
- 2,552
2
votes
1
answer
278
views
Is good reduction decidable?
Let $X$ be a smooth projective geometrically connected variety over $\mathbb{Q}$. It is said to have good reduction at a prime $p$ is there is a smooth projective $\mathcal{X}\to \mathrm{Spec}\:\...
CommunityBot
- 1
7
votes
0
answers
196
views
On thinking of spacetime as a local Scott domain
An observation of Martin and Panangaden links the study of Lorentzian manifolds and the semantics of programming languages via the theory of Scott domains.
Background:
Recall that if $M$ is a time-...
- 63.9k
5
votes
1
answer
276
views
NP-hardness of a sequence problem
Given $n$ binary sequences $s_i$ ($1\le i\le n$) with common period $T$. Let $s_i^{t_i}$ denote the sequence obtained by cyclically shifting $s_i$ for $t_i$ bits. The $n$ sequences form a good system ...
- 6,652
8
votes
0
answers
176
views
Does the "coproduct-elimination transform" have an accepted name, and where can I learn more about it?
Suppose we're in a bicartesian closed category. Then given a morphism $$f : X \rightarrow Y_1 + \ldots + Y_n$$ and a test object $T$, we get a corresponding morphism
$$T^f : X \times [Y_1,T] \times \...
- 3,793
20
votes
1
answer
2k
views
What is Chemlambda? In which ways could it be interesting for a mathematician?
I${}^{*}$ have randomly come across a couple of websites (Chemlambda project, chorasimilarity) that seem to be about a certain "thing" (a computer program, I think) called Chemlambda that does "stuff" ...
- 785
5
votes
1
answer
275
views
How to generate $n$ FP32 rationals s.t. no two distinct k-el. subsets have same sum?
First some
Background: I have lots and lots of integer matrices, whose rows are $k$-combinations (without repetitions and sorted) of numbers from the set $S:=\{1,...,n\}$ and needed to be compared ...
CommunityBot
- 1
0
votes
0
answers
123
views
Vertex cover algorithm
Given a graph $G(V, E)$, remove the vertex (or one of the vertices) with the highest cardinality from $G$ and put it in a list $L$. Repeat until in $G$ there are only vertices with cardinality $0$ (no ...
1
vote
1
answer
565
views
Upper bounding VC dimension of an indicator function class
I would like to upper bound the VC dimension of the function class $ F$ defined as follows:
$$ F := \left\{ (x,t) \mapsto \mathbb{1} \left( c_Q\min_{q \in Q} {\|x-q \|}_1 - t > 0 \right) \; | \; Q ...
CommunityBot
- 1
1
vote
0
answers
144
views
Checking existence of proofs of fixed length
This question is a continuation of a related previous question (check here).
Let $\mathcal{L}$ be a recursive first-order theory with the Hilbert-Ackerman's proof calculus, and such that the ...
- 509
45
votes
4
answers
1k
views
How to write computer-assisted mathematics well?
Much has been said about writting good papers in mathematics. A short google query yields countless sources of advice. This skill also appears to be quite transferrable between basic branches of ...
CommunityBot
- 1
0
votes
0
answers
82
views
Fast double exponentiation in finite fields
Let $p$ be a prime, and let $\mathbb{F}_p$ be the finite field with $p$ elements. Let $a$ be a non-zero element of $\mathbb{F}_p$. Can we quickly evaluate $a^{2^r} \mod{p}$? Using repeated squaring, ...
- 1,703
9
votes
12
answers
11k
views
Propositional logic and first order logic textbook
What are in your opinion some good propositional and first order logic textbooks (undergraduate level)?
I need one that focuses mainly on the aspects of logic related to computer science.
thanks in ...
- 3,274
0
votes
1
answer
158
views
Unknown notation in "Boolean function complexity" by Stasys Jukna [closed]
I am currently reading Boolean Function Complexity - Advances and Frontiers by Stasys Jukna and on page 7 of the latest edition there is a paragraph titled Boolean functions as set systems with the ...
- 869
0
votes
1
answer
381
views
Maximum-weight perfect matching in a 3-regular, complete, 3-partite hypergraph
Let $H=(V, E)$ be a weighted hypergraph such that $V=A\cup B \cup C$, where $A,B,C$ are disjoint sets of size $n$, and $E=A\times B\times C$. In my particular case, $\forall e\in E$, $ wt(e)\in\{0,\pm ...
- 2,720
0
votes
0
answers
125
views
Lower bounds on the length of circuits, depending on the number of times it crosses itself
I have this problem that I have been stuck on for months, and would like to know if somebody can tell me a way to attack the problem. Let me ask the problem in a simple example below.
Let $G(V,E)$ be ...
- 431
1
vote
0
answers
28
views
Modified straightline complexity of almost square of sums
Assume every linear operation (such as inner product with constant vector) can be performed in one step and multiplication by variables (quadratic operation) can be performed in one step.
We know the ...
CommunityBot
- 1
-2
votes
1
answer
252
views
why do the Computability theory choose the natural number as the object of study? [closed]
I am wondering why the computable function is defined in the natural number set. Can people give me the answer or some resources that can solve my puzzle.
- 4,713
0
votes
1
answer
94
views
Value (not position)- based sorting; reference request
A recent answer of Ville Salo on the diameter of a Cayley graph induced by bubble sort generators (adjacent transpositions) has inspired this variation.
Many sort algorithms are position based: you ...
- 24.2k
3
votes
1
answer
96
views
What is known about computing all binary error correcting codes of given parameters?
Define a binary $(n, M, 2e + 1)$ code to be a code $C$ having $M$ code words in $\mathbb{F}_2^n$ whose minimum distance is $2e + 1$.
Are there any sources about using algorithms to find all given ...
- 10.4k
7
votes
3
answers
500
views
Minimum number of swaps needed to 'group' a sequence?
Let a finite sequence $s=\{s_1,\dots,s_N\}$ (the characters of which are chosen from a finite set $\{c_1, \cdots, c_M\}$) be called "grouped" if for any $s_i=s_j$, $i<j$, we have $s_k=s_i=s_j$ for ...
- 30.1k