"Why Turing's Computable Numbers Are Only Non-Constructively Closed ..."

Jeff Edmonds (2025)

> Home

Details and statistics

DOI: 10.3390/E28010071

access: open

type: Journal Article

metadata version: 2026-02-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entropy/Edmonds25a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/Edmonds25a
Jeff Edmonds:
Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition. Entropy 28(1): 71 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.