SHIV DUTT

Evil and Discrete lizard. What are thoughts on adding more tag's in the cs.stackexchange. I think we need more tages like computer algebra etc. What are your thoughts on this?

@DaneJoe Not a first language

math.stackexchange.com/questions/2400288/… please see this

math.stackexchange.com/questions/2393463/…. I have again edited the question.

math.stackexchange.com/questions/2393463/…. Any comment on this further formal or informal

yes

one more condition on $G$, $G \le S_d$ 1) $G$ is either $S_d$ or $A_d$ 2) $\c < d <n$ where c = max \{7, 2 sqrt(n)\}

yes so

act as a symmetric group just means $G = Symmetric $ group .

This problem is related to graph isomorphism in that place we don't talk about cyclic group. $G = C_p$ I am not able to see any problem

hi

$G \times \{B_1,B_2,\cdots B_k\} \mapsto \{B_1,B_2,\cdots B_k\} $, here $G$ is going to be symmetric or an alternating group ( $G$ is a direct product group )

@ Tobias Kildetoft There is an algorithm I have given in the reference section to get minimal block system.

@ anon I have edited the question

a=/b means ?

Please explain in English statements what are u doin

which is polynomial

I need the generating set of $H$

Yes Let me edit the question

@ Mariano Suárez-Álvarez Is H empty ?

@ Mariano Suárez-Álvarez It is a decision problem (yes or no)

@ Crostul then print " no"

@Crostul It is a decision problem

@ Mariano Suárez-Álvarez I have edited the question

Ok thanks

yes that is constant size one symbol.

so do you mean it also depends on the input ?

yes also depend also on old head positions, but that is also can be encoded as a constant size string

A snapshot is machine's state and symbol read by all heads.

but I can assume snapshot as a constant size string for tighter bound.

in the question I have assumed snapshot is $O(T(n))$ or in other words considered configuration of Turing machine as a snapshot

A snapshot is machine's state and symbol read by all heads. For second question $z_i$ snapshot depends upon the three cells directly above it (it is a map from $\tau^3 $ to $\tau$) , which is constant so it can be encoded by constant size circuit

Definitely yes, provide some missing point or detail in a proof, so that I can work on them.

In a new draft it is written that we can get a circuit of size $O(T(n))$. I am thinking like this, we have snapshots like $z_1,z_2,....z_{T(n)}$ and for each $z_i$ to $z_{i+1}$, I have a constant size circuit , so total size is going to be $O(T(n)).