You mean the generator problem, for architecture, is solvable?

The astonished question of the unnamed computer scientist upon hearing the generative sequence concept; its answer is a central claim of the chapter.

Neighborhood — ranked by edge-count

Thinkers (1)

thinker

Unnamed Silicon Valley computer scientist
cites
Prominent computer scientist who, upon hearing the apartment building sequence, instantly recognized the significance of the generator problem being solvable.

Claims (1)

claim

The generator problem, for architecture, is solvable.
gates
Alexander's assertoric answer to the computer scientist's question; claims that generative sequences can be worked out for a large number of architectural cases.

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.

Evolution often produces general-purpose problem-solving machines whose capacities cannot be inferred from the default invariant course of development.claim0.734
A claim about the outcome of the MCA-enhanced process.
Living structure in buildings can only be GENERATED. It cannot be created by brute force from designs.claim0.730
Core thesis of Book 2, stated at the transition to Part Two.
Complex, generated structure cannot be arrived at in any other way.quote0.730
Concise statement that underscores the necessity of the generated process for real complexity.
Truly successful programs can only be generated; and the way forward in the next decades will be through programs which are generated through unfolding, in some fashion comparable to what I have described for buildings.hypothesis0.729
Predicts that the only path to highly adapted software is to apply the principles of generated structure.
In modern architecture, neither design nor construction typically works step by step; instead there is a fixed end-state produced without realistic feedback.claim0.723
Contrast between living process and current architectural practice.
Languages that cannot be automatically evaluated inevitably contain unresolvable paradoxes; constructive computation avoids this by building representations over simple step-by-step operations.claim0.723
Paper's interpretation of Gödel's incompleteness result as motivating computationalism
It is theoretically impossible to build a successful building from a set of drawings specifying every detail.claim0.722
Because feedback is needed to shape elements during construction.
The design problem is redefined not around building a structure to last, but promoting processesclaim0.721
Assertion from the NRCS specification sheet that LTPBR shifts focus from structural permanence to process promotion.