I have read that problems resemblings collatz have been shown to be undecidable. Conway proved that apparantly but Im not sure if the proof was constructive.
So I wonder : What is the simplest collatz like problem that is undecidable ?
I have read that problems resemblings collatz have been shown to be undecidable. Conway proved that apparantly but Im not sure if the proof was constructive.
So I wonder : What is the simplest collatz like problem that is undecidable ?
Copyright © 2021 JogjaFile Inc.