1
vote
1answer
140 views
What structure has been found for functions with this relationship.
Given $f$ and $g$
$\forall x y. f(x) = f(y) \Longrightarrow f(g(x)) = f(g(y))$
Or equivalently
$ker\ f \subseteq ker\ (f \circ g)$.
Note: if $f$ is injective then this holds fo …
0
votes
0answers
92 views
An interesting version of the problem “balls into bins”
Consider n people, each has k identical balls. Each people choose k different bins from m bins, constrained by the condition that there are no two people choose exactly the same k …
10
votes
0answers
178 views
Splay trees and Thompson’s group $F$
( I apologize for only indicating some easy to find references, but new users are not allowed to link more than five). This is very speculative, but:
Question: Is there a reformul …
2
votes
2answers
109 views
Smallest base to reach partial recursive functions as a closure of unbound search
It is customary to define the class of partial recursive functions by taking the set of primitive recursive functions $PR$ and taking closure over unbound search operation.
Do we …
0
votes
0answers
63 views
Schönhage’s SMM with only one instruction
It is possible to implement $\lambda$-calculus in Schönhage's storage modification machine using an infinite set of nodes and one single program consisted exclusively of (about hun …
7
votes
6answers
891 views
Giving $Top(X,Y)$ an appropriate topology
I am not sure if its OK to ask this question here.
Let $Top$ be the category of topological spaces. Let $X,Y$ be objects in $Top$.
Let $F:\mathbb{I}\rightarrow Top(X,Y)$ be a fu …
3
votes
2answers
383 views
Turing-complete primitive blind automata
Let $N$ be the set of natural numbers, $S$ be the set of finite binary sequences, and
$Q = [N \rightarrow N] \times [N \rightarrow N],$
where $[N \rightarrow N]$ is the set of al …
0
votes
1answer
100 views
Distance between vertices in a vertex transitive graphs. [closed]
Can anybody help me in finding out the distances between vertices in a vertex transitive graphs. Is there any specific formula to calculate distance between vertices in this graph. …
1
vote
0answers
107 views
Hypothesis: interaction-based model for maximum consistent theories
We are looking for counter-examples to the following
Hypothesis. In interaction calculus $\langle \varnothing\ |\ \Gamma(M, x) \cup \Gamma(N, x)\rangle \downarrow \langle \varnoth …
1
vote
0answers
74 views
Is it possible to implement η-reduction in interaction nets?
There are several ways to encode λ-terms in interaction nets; for instance, using the original optimal algorithm by Lamping, or compiling λ-calculus into interaction combinators. H …
0
votes
1answer
160 views
Deriving the fundamental equation (with regards to computer vision)
I'm having a hard time understanding how a few equations are being derived. So the fundamental equation is an equation that relates corresponding points in stereo images. Anyway, t …
1
vote
1answer
118 views
Grzegorczyk-hierarchy, growth-rate and functions with finite image
Grzegorczyk-hierarchy divides primitive recursive functions in distinct classes with respect to their growth-rate. It seems that the higher we go the hierarchy, the more tools we h …
3
votes
2answers
534 views
How to draw Archimedean-Galileo spiral?
It is known that some plane curves can be drawn with a tool. For instance, I heard at a web site that Archimedes created his spiral in the third century B.C. by fooling around with …
5
votes
2answers
170 views
Rigorous numerics for maxima and minima (one variable)
Let $f:\mathbb{R}_0^+\to \mathbb{R}$ be defined by some combination of the four basic operations and square roots. (The argument of square-roots is assumed is to be non-negative, a …
1
vote
1answer
107 views
Reducing the error of Algorithms by assigning variables formulas instead of values
Let me first give the intuition for my question: Suppose that you want to use a ruler to mark $n$ points in a line on a page, with 1 cm distance between neighbor points. There are …

