Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Tristan Stérin
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
On the hardness of knowing busy beaver values BB(15) and BB(5, 4).
2021
Tristan Stérin
Damien Woods
+
Small tile sets that compute while solving mazes
2021
Matthew Cook
Tristan Stérin
Damien Woods
+
Small tile sets that compute while solving mazes
2021
Matthew Cook
Tristan Stérin
Damien Woods
+
On the hardness of knowing busy beaver values BB(15) and BB(5,4)
2021
Tristan Stérin
Damien Woods
+
Small tile sets that compute while solving mazes
2021
Matthew Cook
Tristan Stérin
Damien Woods
+
The Collatz process embeds a base conversion algorithm
2020
Tristan Stérin
Damien Woods
+
scadnano: A browser-based, scriptable tool for designing DNA nanostructures
2020
David Doty
Benjamin L Lee
Tristan Stérin
+
Limitations on counting in Boolean circuits and self-assembly
2020
Tristan Stérin
Damien Woods
+
PDF
Chat
The Collatz Process Embeds a Base Conversion Algorithm
2020
Tristan Stérin
Damien Woods
+
PDF
Chat
Binary Expression of Ancestors in the Collatz Graph
2020
Tristan Stérin
+
The Collatz process embeds a base conversion algorithm
2020
Tristan Stérin
Damien Woods
+
scadnano: A browser-based, scriptable tool for designing DNA nanostructures
2020
David Doty
Benjamin L Lee
Tristan Stérin
+
First Occurrence of Parity Vectors and the Regular Structure of k-Span Predecessor Sets in the Collatz Graph.
2019
Tristan Stérin
+
Binary expression of ancestors in the Collatz graph
2019
Tristan Stérin
+
Binary expression of ancestors in the Collatz graph
2019
Tristan Stérin
Common Coauthors
Coauthor
Papers Together
Damien Woods
9
Matthew Cook
3
Benjamin L Lee
2
David Doty
2
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
The 3<i>x</i>+ 1 Problem and its Generalizations
1985
Jeffrey C. Lagarias
4
+
PDF
Chat
The Undecidability of the Generalized Collatz Problem
2007
Stuart A. Kurtz
Janoš Šimon
4
+
PDF
Chat
The Dynamical System Generated by the 3n+1 Function
1998
Günther Wirsching
4
+
PDF
Chat
The Collatz Process Embeds a Base Conversion Algorithm
2020
Tristan Stérin
Damien Woods
4
+
Working in binary protects the repetends of 1/3 : Comment on Colussi's ‘The convergence classes of Collatz function’
2015
Patrick Chisan Hew
4
+
The convergence classes of Collatz function
2011
Livio Colussi
3
+
Cellular Automata, the Collatz Conjecture and Powers of 3/2
2012
Jarkko Kari
2
+
The 3x+1 problem: An annotated bibliography
2003
Jeffrey C. Lagarias
2
+
The 3x+1 problem: An annotated bibliography (1963--1999) (sorted by author)
2003
Jeffrey C. Lagarias
2
+
Two Cellular Automata for the 3x+1 Map
2005
M. Bruschi
2
+
The "3x + 1" Problem and Finite Automata.
1992
Jeffrey Shallit
David A. Wilson
2
+
The 2-Adic, Binary and Decimal Periods of 1/3k Approach Full Complexity for Increasing k
2012
Josefina López
Peter Stoll
2
+
The complexity of small universal Turing machines: A survey
2008
Damien Woods
Turlough Neary
2
+
The autoconjugacy of the 3x+1 function
2003
Kenneth G. Monks
Jonathan Yazinski
2
+
On the complexity of algebraic numbers I. Expansions in integer bases
2007
Boris Adamczewski
Yann Bugeaud
2
+
PDF
Chat
Ternary expansions of powers of 2
2009
Jeffrey C. Lagarias
2
+
PDF
Chat
Generalized shifts: unpredictability and undecidability in dynamical systems
1991
Cristopher Moore
2
+
The 3x+1 Problem: A Quasi Cellular Automaton.
1987
Thomas Cloney
Eric Goles
Gérard Y. Vichniac
2
+
PDF
Chat
Complexity of Self‐Assembled Shapes
2007
David Soloveichik
Erik Winfree
2
+
Mahler's method in several variables II: Applications to base change problems and finite automata
2018
Boris Adamczewski
Colin Faverjon
2
+
PDF
Chat
Odd Collatz Sequence and Binary Representations
2019
Jose Capco
2
+
PDF
Chat
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity
2014
Hermann Gruber
Markus Holzer
2
+
PDF
Chat
Some Unconventional Problems in Number Theory
1979
P. Erdős
2
+
PDF
Chat
Introducing improved structural properties and salt dependence into a coarse-grained model of DNA
2015
Benedict Snodin
Ferdinando Randisi
Majid Mosayebi
Petr Šulc
John S. Schreck
Flavio Romano
Thomas E. Ouldridge
Roman Tsukanov
Eyal Nir
Ard A. Louis
1
+
Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding
2018
Olivier Rozier
1
+
PDF
Chat
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
2013
Damien Woods
Ho-Lin Chen
Scott Goodfriend
Nadine Dabby
Erik Winfree
Peng Yin
1
+
PDF
Chat
The Tile Assembly Model is Intrinsically Universal
2012
David Doty
Jack H. Lutz
Matthew J. Patitz
Robert Schweller
Scott M. Summers
Damien Woods
1
+
The sufficiency of arithmetic progressions for the 3𝑥+1 Conjecture
2006
Kenneth G. Monks
1
+
The program-size complexity of self-assembled paths
2020
Pierre-Étienne Meunier
Damien Regnault
Damien Woods
1
+
Convergence verification of the Collatz problem
2020
David Barina
1
+
PDF
Chat
Covert Computation in Self-Assembled Circuits
2020
Angel A. Cantu
Austin Luchsinger
Robert Schweller
Tim Wylie
1
+
Reversible Logic Synthesis with Minimal Usage of Ancilla Bits
2015
Siyao Xu
1
+
PDF
Chat
Small Weakly Universal Turing Machines
2009
Turlough Neary
Damien Woods
1
+
Simulation of the Collatz 3x+1 function by Turing machines
2014
Michel Pascal
1
+
PDF
Chat
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
2013
Erik D. Demaine
Matthew J. Patitz
Trent A. Rogers
Robert Schweller
Scott M. Summers
Damien Woods
1
+
The $3x+1$ problem, generalized Pascal triangles and cellular automata
1992
Ivan Korec
1
+
An Introduction to the Theory of Groups
1965
Joseph Rotman
1
+
PDF
Chat
Introducing a Finite State Machine for Processing Collatz Sequences
2017
Eldar Sultanow
Д С Волков
Sean Cox
1
+
PDF
Chat
Binary Expression of Ancestors in the Collatz Graph
2020
Tristan Stérin
1
+
Small tile sets that compute while solving mazes
2021
Matthew Cook
Tristan Stérin
Damien Woods
1
+
Combinatorial Species and Tree-like Structures
1997
François Bergeron
Gilbert Labelle
Pierre Leroux
1
+
The Busy Beaver Competition: a historical survey
2009
Michel Pascal
1
+
The two-handed tile assembly model is not intrinsically universal
2013
Erik D. Demaine
Matthew J. Patitz
Trent A. Rogers
Robert Schweller
Scott M. Summers
Damien Woods
1
+
PDF
Chat
Strongly Universal Reversible Gate Sets
2016
Tim Boykett
Jarkko Kari
Ville Salo
1
+
PDF
Chat
Self-assembly with Geometric Tiles
2012
Bin Fu
Matthew J. Patitz
Robert Schweller
Robert Sheline
1
+
PDF
Chat
Computations with p-adic numbers
2017
Xavier Caruso
1
+
The 3x+1 Problem and Integer Representations
2015
Jeffrey R. Goodwin
1
+
Bits of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math> in binary, Wieferich primes and a conjecture of Erdős
2015
Taylor Dupuy
David E. Weirich
1
+
PDF
Chat
Intrinsic universality and the computational power of self-assembly
2015
Damien Woods
1
+
On a Conjecture of Crandall Concerning the qx + 1 Problem
1995
Zachary Franco
Carl Pomerance
1