Joshua Brandon Holden

2 Questions 9 Answers 0 Followers

Questions related from Joshua Brandon Holden

Does anyone know the smallest known number of states that a one-way cellular automata needs to be universal?

We know there is an elementary cellular automata (ECA) with 2 states (Rule 110) that is universal, i.e. Turing-complete. One-way cellular automata (OCA's) are a subcategory of ECA's where the...

24 November 2016 7,294 4 View

Do these subgroups generate all of S_n?

This question is inspired by classical cryptography, namely transposition ciphers, but it's really a pure problem in permutation groups, which isn't really my field. Suppose k divides n and you...

24 December 2012 1,770 7 View