User Ilmari Karonen

25 votes

in O(n) time: Find greatest element in set where comparison is not transitive

answered Nov 20, 2017 at 21:59

21 votes

Accepted

Is there a more intuitive proof of the halting problem's undecidability than diagonalization?

answered May 21, 2015 at 10:38

16 votes

One element that differs in two arrays. How to find it efficiently?

answered Dec 16, 2016 at 16:43

15 votes

Accepted

What is the reason of inaccuracy of operations on float numbers?

answered Aug 19, 2013 at 9:11

15 votes

Accepted

Is there an anti-Bloom filter?

answered Apr 26, 2014 at 7:35

9 votes

Can a program exist that halts only if it can prove that it doesn't halt?

answered Apr 28, 2021 at 17:35

9 votes

Data structure for fast insertion and fast random element removal

answered Nov 24, 2021 at 19:40

8 votes

Without using pumping lemma, can we determine if $A =\{ww \mid w \in \{0,1\}^* \}$ is non regular?

answered May 3, 2013 at 20:03

8 votes

Accepted

Langton's Ant Periodic Behavior

answered Jul 22, 2019 at 14:44

7 votes

Are there programs that never halt and have no non-termination proof?

answered Dec 24, 2014 at 15:06

5 votes

Accepted

Does a shift operation distribute over XOR

answered Jun 5, 2016 at 9:38

5 votes

Is zero allowed as an edge's weight, in a weighted graph?

answered Jul 28, 2016 at 14:58

5 votes

Accepted

Is the bitwise-xor of a Uniform bit string and a non_uniform bit string Uniform?

answered Nov 14, 2018 at 16:36

5 votes

Why is { w | |w| mod 3 = #_a(w) mod 3 } a Regular Language?

answered Jun 20, 2022 at 22:14

4 votes

Accepted

Usefulness of binary extension field GF(2^n)

answered Jan 17 at 13:15

4 votes

Algorithm for fastest division below threshold

answered Apr 12, 2015 at 14:07

3 votes

Does every data type just boil down to nodes with pointers?

answered Jan 7, 2017 at 16:24

3 votes

I want a fast rank only shuffling algorithm for a full 52 card deck

answered Oct 19, 2018 at 15:17

3 votes

Accepted

Strategy for searching for elementary cellular automata (cyclic boundary conditions) that repeat

answered Aug 12, 2022 at 11:36

3 votes

Accepted

Cellular automata on the Eisenstein integers?

answered Jun 13, 2022 at 13:49

2 votes

pick K random integers without repetition

answered Jan 24 at 20:36

2 votes

Accepted

2d cellular automata Wolfram binary codes

answered Aug 17, 2020 at 17:15

2 votes

How to prevent the optimization algorithm from just shrinking the image?

answered Dec 10, 2017 at 22:34

2 votes

Accepted

How to create a cellular automata rule to achieve a desired pattern?

answered Feb 7, 2019 at 6:32

1 vote

How to effectively represent and generate 2D cellular automaton rules that are invariant under rotation and reflection of the input matrix?

answered Sep 23, 2019 at 11:11

1 vote

Accepted

Can Sutner's (1991) quadratic algorithm for testing reversibility of Cellular Automata be applied to 1-D CA with even sized neighborhoods?

answered Feb 17, 2023 at 13:29

1 vote

Is it possible to reverse engineer cellular automata?

answered Jun 20, 2021 at 14:01

0 votes

Accepted

What are the differences/relationship between 2D Turing Machines and Cellular Automata

answered Oct 10, 2021 at 16:06

Stack Exchange Network

28 Answers

in O(n) time: Find greatest element in set where comparison is not transitive

Is there a more intuitive proof of the halting problem's undecidability than diagonalization?

One element that differs in two arrays. How to find it efficiently?

What is the reason of inaccuracy of operations on float numbers?

Is there an anti-Bloom filter?

Can a program exist that halts only if it can prove that it doesn't halt?

Data structure for fast insertion and fast random element removal

Without using pumping lemma, can we determine if $A =\{ww \mid w \in \{0,1\}^* \}$ is non regular?

Langton's Ant Periodic Behavior

Are there programs that never halt and have no non-termination proof?

Does a shift operation distribute over XOR

Is zero allowed as an edge's weight, in a weighted graph?

Is the bitwise-xor of a Uniform bit string and a non_uniform bit string Uniform?

Why is { w | |w| mod 3 = #_a(w) mod 3 } a Regular Language?

Usefulness of binary extension field GF(2^n)

Algorithm for fastest division below threshold

Does every data type just boil down to nodes with pointers?

I want a fast rank only shuffling algorithm for a full 52 card deck

Strategy for searching for elementary cellular automata (cyclic boundary conditions) that repeat

Cellular automata on the Eisenstein integers?

pick K random integers without repetition

2d cellular automata Wolfram binary codes

How to prevent the optimization algorithm from just shrinking the image?

How to create a cellular automata rule to achieve a desired pattern?

How to effectively represent and generate 2D cellular automaton rules that are invariant under rotation and reflection of the input matrix?

Can Sutner's (1991) quadratic algorithm for testing reversibility of Cellular Automata be applied to 1-D CA with even sized neighborhoods?

Is it possible to reverse engineer cellular automata?

What are the differences/relationship between 2D Turing Machines and Cellular Automata