Skip to main content

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.

6 questions from the last 30 days
Filter by
Sorted by
Tagged with
6 votes
2 answers
736 views

Shifting an irrational binary sequence

Let $\newcommand{\tn}{\{0,1\}^\mathbb{N}}\tn$ be the collection of all infinite binary sequences. For $s\in\tn$ and $k\in\mathbb{N}$ let the left-shift of $s$ by $k$ positions, $\ell_k(s)\in \tn$, be ...
Dominic van der Zypen's user avatar
5 votes
1 answer
470 views

Is the set of generalized Fermat triples computable?

Is $\;\big\{(a,b,c)\in\mathbb{N}^3: \big(\exists m,n,\ell \in (\mathbb{N}\setminus\{0,1,2\})\big): a^m + b^n= c^\ell\big\}\;$ computable?
Dominic van der Zypen's user avatar
3 votes
1 answer
103 views

References: rigorous algorithms for elementary computations in base-b with complexity estimates

Definitions/Notation: Fix positive integers $b$ and $M$. Consider the set of real numbers which can be exactly expressed with $2M+1$ coefficients in base $b$, defined by $$\mathcal{X}(b,M):=\{x\in \...
ABIM's user avatar
  • 5,405
3 votes
0 answers
120 views

References on P vs NP under various axiomatic systems

I am teaching algorithms and theory of computation this semester and had the opportunity to dig a bit into the details of one way functions and the P vs NP problem. This problem has resisted attacks ...
ode's user avatar
  • 31
6 votes
0 answers
102 views

Computer program for free restricted Lie polynomial

I am conducting numerical experiments involving the Gröbner–Shirshov Basis for restricted Lie algebras. At each step of the computation, I need to work with restricted Lie polynomials. Specifically, I ...
gualterio's user avatar
  • 1,013
1 vote
1 answer
45 views

Graph classes which have small edge k-cuts

I am interested in graph classes that have the following property: There exists a function $f(k)$ such that for every graph $G$ in the class, for every choice of $k$ vertices $v_1, \ldots, v_k$ in the ...
Vilhelm Agdur's user avatar