- See Also
-
Links
- “Transformers Learn Shortcuts to Automata”, Et Al 2022
- “Transformers Implement First-Order Logic With Majority Quantifiers”, 2022
- “Python Type Hints Are Turing Complete”, 2022
- “What Can Transformers Learn In-Context? A Case Study of Simple Function Classes”, Et Al 2022
- “Perceptein: A Synthetic Protein-level Neural Network in Mammalian Cells”, Et Al 2022
- “Neural Networks and the Chomsky Hierarchy”, Et Al 2022
- “Log-Precision Transformers Are Constant-Depth Uniform Threshold Circuits”, 2022
- “An RNA-based Theory of Natural Universal Computation”, 2022
- “Overcoming a Theoretical Limitation of Self-Attention”, 2022
- “A Deep Dive into an NSO Zero-click IMessage Exploit: Remote Code Execution”, Beer & Groß 2021
- “Minimum Description Length Recurrent Neural Networks”, Et Al 2021
- “RASP: Thinking Like Transformers”, Et Al 2021
- “Turing Completeness and Sid Meier’s Civilization”, 2021
- “Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine”, 2021
- “How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of The ‘Busy Beaver’ Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, 2020
- “Remembering John Conway’s FRACTRAN, a Ridiculous, yet Surprisingly Deep Language”, 2020
- “Magic: the Gathering Is As Hard As Arithmetic”, 2020
- “Recursed Is Not Recursive: A Jarring Result”, Et Al 2020
- “The Busy Beaver Frontier”, 2019
- “Magic: The Gathering Is Turing Complete”, Et Al 2019
- “On the Turing Completeness of Modern Neural Network Architectures”, Et Al 2019
- “Adversarial Reprogramming of Neural Networks”, Et Al 2018
- “Mechanical Computing System Using Only One Physical Object-Qb﹚ Cube”, 2018
- “Weird Machines, Exploitability, and Provable Unexploitability”, 2017
- “Java Generics Are Turing Complete”, 2016
- “What Are Weird Machines?”, 2015
- “Braid Is Undecidable”, 2014
- “On Unsettleable Arithmetical Problems”, 2013
- “The Page-Fault Weird Machine: Lessons in Instruction-less Computation”, 2013
- “On Universal Prediction and Bayesian Confirmation”, 2007
- “Infinite Versions of Minesweeper Are Turing Complete”, 2007
- “A Box, Darkly: Obfuscation, Weird Languages, and Code Aesthetics”, 2005
- “Time Travel and Computing”, 1991
- “A Differentiation Primitive for Extended Λ–calculus”, 1988
- “FRACTRAN: A Simple Universal Programming Language for Arithmetic”, 1987
- “Unpredictable Iterations”, 1972
- “FLODAC—A Pure Fluid Digital Computer”, Et Al 1964
- “On Non-Computable Functions”, 1962
- “ByteByteJump”, 2023
- “Linear Bounded Automaton”
- “OISC”
- “MalbolgeLisp Is a LISP Interpreter Written in Malbolge. It’s as of 2020 and 2021, the Most Advanced, Usable Malbolge Program Ever Created. It Supports Everything Lisps Generally Tend to Support (like Cond, Let, Lambda, Etc…).”
- Wikipedia
- Miscellaneous
- Link Bibliography
See Also
Links
“Transformers Learn Shortcuts to Automata”, Et Al 2022
“Transformers Learn Shortcuts to Automata”, 2022-10-19 (; similar)
“Transformers Implement First-Order Logic With Majority Quantifiers”, 2022
“Transformers Implement First-Order Logic with Majority Quantifiers”, 2022-10-06 (; similar)
“Python Type Hints Are Turing Complete”, 2022
“Python Type Hints are Turing Complete”, 2022-08-31 (similar)
“What Can Transformers Learn In-Context? A Case Study of Simple Function Classes”, Et Al 2022
“What Can Transformers Learn In-Context? A Case Study of Simple Function Classes”, 2022-08-01 (; backlinks; similar; bibliography)
“Perceptein: A Synthetic Protein-level Neural Network in Mammalian Cells”, Et Al 2022
“Perceptein: A synthetic protein-level neural network in mammalian cells”, 2022-07-11 (; backlinks; similar)
“Neural Networks and the Chomsky Hierarchy”, Et Al 2022
“Neural Networks and the Chomsky Hierarchy”, 2022-07-05 (; similar)
“Log-Precision Transformers Are Constant-Depth Uniform Threshold Circuits”, 2022
“Log-Precision Transformers are Constant-Depth Uniform Threshold Circuits”, 2022-07-02 (; similar)
“An RNA-based Theory of Natural Universal Computation”, 2022
“An RNA-based theory of natural universal computation”, 2022-03-21 (; backlinks; similar)
“Overcoming a Theoretical Limitation of Self-Attention”, 2022
“Overcoming a Theoretical Limitation of Self-Attention”, 2022-02-24 (; similar)
“A Deep Dive into an NSO Zero-click IMessage Exploit: Remote Code Execution”, Beer & Groß 2021
“A deep dive into an NSO zero-click iMessage exploit: Remote Code Execution”, 2021-12-15 (; backlinks; similar)
“Minimum Description Length Recurrent Neural Networks”, Et Al 2021
“Minimum Description Length Recurrent Neural Networks”, 2021-10-31 (; similar)
“RASP: Thinking Like Transformers”, Et Al 2021
“RASP: Thinking Like Transformers”, 2021-06-13 (; backlinks; similar; bibliography)
“Turing Completeness and Sid Meier’s Civilization”, 2021
“Turing Completeness and Sid Meier’s Civilization”, 2021-04-29 (similar)
“Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine”, 2021
“Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine”, 2021-04-22 (; backlinks; similar)
“How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of The ‘Busy Beaver’ Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, 2020
“How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The goal of the 'busy beaver' game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics”, 2020-12-10 (; similar; bibliography)
“Remembering John Conway’s FRACTRAN, a Ridiculous, yet Surprisingly Deep Language”, 2020
“Remembering John Conway’s FRACTRAN, a ridiculous, yet surprisingly deep language”, 2020-05-03 (; backlinks; similar)
“Magic: the Gathering Is As Hard As Arithmetic”, 2020
“Magic: the Gathering is as Hard as Arithmetic”, 2020-03-11 (backlinks; similar)
“Recursed Is Not Recursive: A Jarring Result”, Et Al 2020
“Recursed is not Recursive: A Jarring Result”, 2020-02-12 (backlinks; similar)
“The Busy Beaver Frontier”, 2019
“The Busy Beaver Frontier”, 2019-08-28 (backlinks; similar; bibliography)
“Magic: The Gathering Is Turing Complete”, Et Al 2019
“Magic: The Gathering is Turing Complete”, 2019-03-24 (backlinks; similar)
“On the Turing Completeness of Modern Neural Network Architectures”, Et Al 2019
“On the Turing Completeness of Modern Neural Network Architectures”, 2019-01-10 (; similar)
“Adversarial Reprogramming of Neural Networks”, Et Al 2018
“Adversarial Reprogramming of Neural Networks”, 2018-06-28 (; backlinks; similar)
“Mechanical Computing System Using Only One Physical Object-Qb﹚ Cube”, 2018
“Mechanical Computing System Using Only One Physical Object-qb﹚ cube”, 2018-01-14
“Weird Machines, Exploitability, and Provable Unexploitability”, 2017
“Weird machines, exploitability, and provable unexploitability”, 2017-12-19 (; backlinks; similar)
“Java Generics Are Turing Complete”, 2016
“Java Generics are Turing Complete”, 2016-05-17 (backlinks)
“What Are Weird Machines?”, 2015
“What are Weird Machines?”, 2015 (; backlinks; similar; bibliography)
“Braid Is Undecidable”, 2014
“Braid is undecidable”, 2014-12-02 (backlinks; similar)
“On Unsettleable Arithmetical Problems”, 2013
“On Unsettleable Arithmetical Problems”, 2013-01 (; backlinks; similar; bibliography)
“The Page-Fault Weird Machine: Lessons in Instruction-less Computation”, 2013
“On Universal Prediction and Bayesian Confirmation”, 2007
“On Universal Prediction and Bayesian Confirmation”, 2007-09-11 (; similar)
“Infinite Versions of Minesweeper Are Turing Complete”, 2007
“A Box, Darkly: Obfuscation, Weird Languages, and Code Aesthetics”, 2005
“A Box, Darkly: Obfuscation, Weird Languages, and Code Aesthetics”, 2005-12 (; similar)
“Time Travel and Computing”, 1991
“Time Travel and Computing”, 1991 ()
“A Differentiation Primitive for Extended Λ–calculus”, 1988
“A differentiation primitive for extended λ–calculus”, 1988-02-01
“FRACTRAN: A Simple Universal Programming Language for Arithmetic”, 1987
“FRACTRAN: A Simple Universal Programming Language for Arithmetic”, 1987 (; backlinks)
“Unpredictable Iterations”, 1972
“Unpredictable Iterations”, 1972 (backlinks)
“FLODAC—A Pure Fluid Digital Computer”, Et Al 1964
“FLODAC—A Pure Fluid Digital Computer”, 1964-10-27 ()
“On Non-Computable Functions”, 1962
“On Non-Computable Functions”, 1962-05-01 (backlinks; similar)
“ByteByteJump”, 2023
“Linear Bounded Automaton”
“OISC”
“MalbolgeLisp Is a LISP Interpreter Written in Malbolge. It’s as of 2020 and 2021, the Most Advanced, Usable Malbolge Program Ever Created. It Supports Everything Lisps Generally Tend to Support (like Cond, Let, Lambda, Etc…).”
Wikipedia
Miscellaneous
Link Bibliography
-
https://arxiv.org/abs/2208.01066: “What Can Transformers Learn In-Context? A Case Study of Simple Function Classes”, Shivam Garg, Dimitris Tsipras, Percy Liang, Gregory Valiant: -
https://arxiv.org/abs/2106.06981: “RASP: Thinking Like Transformers”, Gail Weiss, Yoav Goldberg, Eran Yahav: -
https://www.quantamagazine.org/the-busy-beaver-game-illuminates-the-fundamental-limits-of-math-20201210/: “How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The Goal of the 'busy Beaver' Game Is to Find the Longest-running Computer Program. Its Pursuit Has Surprising Connections to Some of the Most Profound Questions and Concepts in Mathematics”, John Pavlus: -
2019-aaronson.pdf: “The Busy Beaver Frontier”, Scott Aaronson: -
https://www.cs.dartmouth.edu/~sergey/wm/: “What Are Weird Machines?”, Sergey Bratus: -
2013-conway.pdf: “On Unsettleable Arithmetical Problems”, John H. Conway: