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]

@article{Edmonds25a,
  title = {Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition},
  author = {Jeff Edmonds},
  year = {2025},
  doi = {10.3390/e28010071},
  url = {https://doi.org/10.3390/e28010071},
  researchr = {https://researchr.org/publication/Edmonds25a},
  cites = {0},
  citedby = {0},
  journal = {Entropy},
  volume = {28},
  number = {1},
  pages = {71},
}