claim

active

claim:much-of-the-usefulness-of-computation-lies-in-data-reduction-removing-the-haystack-to-leave-the-needle

Much of the usefulness of computation lies in data reduction—removing the haystack to leave the needle

Normal forms are exponentially large; computing them makes explicit only necessary information while discarding most input data, explaining apparent information increase.

Source paper

extracted_from

Information, Processes and Games

Abramsky, Samson

Neighborhood — ranked by edge-count

Papers (1)

paper

Information, Processes and Games
supports

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Information increase in computation arises from data reduction and making implicit information explicit, not logical increase.claim0.774
Author's proposed resolution to the information increase paradox: computation gains utility through extraction and filtering, not creation of logically new content.
Computation is a game of empowerment and, therefore, the investment in opening the design process remains a critical challenge for contemporary architecture.claim0.772
Final normative claim: computation’s nature as a game demands architectural openness, a challenge yet to be met.
Why do we compute? The natural answer is: to gain information (which we did not previously have)! But how is this possible?concept0.765
Opening framing of the central puzzle driving the entire investigation into information dynamics.
When a problem has a simple solution, a useful system will give programmers access to the simple solution; Parlog forces complex solutions to simple problems.claim0.765
Critique that Parlog's abstraction level is too high and restrictive.
"Why do we compute? The natural answer is: to gain information (which we did not previously have)!"concept0.752
If computational functionalism is correct, then some computations suffice for consciousness and the question is which ones and when they will exist in AI.hypothesis0.752
Conditional underlying the consciousness route.
Two concepts should not have the same purpose; additional concepts for the same purpose create needless complexity.claim0.746
No redundancy criterion.
We hypothesize that general computational machines with sufficient resources possess the necessary and sufficient means to implement consciousness, and that successful implementation can be established via analysis or testing.hypothesis0.746
The central hypothesis of the paper