Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition

Jeff Edmonds. Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition. Entropy, 28(1):71, 2025. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.