scientific article; zbMATH DE number 5885061
From MaRDI portal
Publication:2996237
zbMATH Open1230.11033MaRDI QIDQ2996237FDOQ2996237
Authors: Pascal Michel, M. Margenstern 
Publication date: 6 May 2011
Title of this publication is not available (Why is that?)
Recommendations
- Computability theory of generalized functions
- On total functions, existence theorems and computational complexity
- Generalized arithmetical functions of three variables
- Third-Order Computation and Bounded Arithmetic
- GeneralizedPC1-functions
- Algebraic functions of complexity one, a Weierstrass theorem, and three arithmetic operations
- Computational properties of three-term recurrence relations for Kummer functions
- Computations in cubic function fields of characteristic three
- scientific article; zbMATH DE number 65741
- scientific article; zbMATH DE number 1114509
Cited In (15)
- Two undecidable variants of Collatz's problems
- Problems in number theory from busy beaver competition
- The Collatz conjecture and de Bruijn graphs
- The ultimate challenge. The \(3x+1\) problem
- Injectivity and surjectivity of Collatz functions
- Maurice Margenstern's contributions to the field of small universal Turing machines
- Unpredictable iterations
- Teaching the computer how to discover(!) and then prove(!!) (all by itself(!!!)) analogues of Collatz's notorious 3x + 1 conjecture
- \(3x + 1\) search programs
- Generalized tag systems
- The Undecidability of the Generalized Collatz Problem
- FRACTRAN: a simple universal programming language for arithmetic
- \(3x + 1\) search programs
- Tag systems and Collatz-like functions
- Iteration of functions and contractibility of acyclic 2-complexes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996237)
