1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2022
Turing machine interaction problem
Marsel Matdinov
The article introduces some ideas for solving special cases of the following problem, proposed in a somewhat generalized form by Marcus Hutter in 2000. Given two Turing machines $A…
cs.CC2020
Circuit Satisfiability Problem for circuits of small complexity
Marsel Matdinov
The following problem is considered. A Turing machine , that accepts a string of fixed length as input, runs for a time not exceeding a fixed value and is guaranteed to…
math.CO2011★ 1 cited
Size of components of a cube coloring
Marsel Matdinov
Suppose a d-dimensional lattice cube of size n^d is colored in several colors so that no face of its triangulation (subdivision of the standard partition into n^d small cubes) is c…