View in EDS HTML Full Text PDF Full Text

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

Saved in:
Bibliographic Details
Title: Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition.
Authors: Edmonds, Jeff1 (AUTHOR)
Source: Entropy. Jan2026, Vol. 28 Issue 1, p71. 6p.
Database: Academic Search Ultimate
Full text is not displayed to guests.
Description
ISSN:10994300
DOI:10.3390/e28010071