The following pages link to Edgar G. Daylight (Q941464):
Displayed 11 items.
- The formalism underlying EASYMAP: A precompiler for refinement-based exploration of hierarchical data organizations (Q941466) (← links)
- Time-bounded incompressibility of compressible strings and sequences (Q989573) (← links)
- Towards a Historical Notion of ‘Turing—the Father of Computer Science’ (Q2963951) (← links)
- (Q3130803) (← links)
- (Q3457263) (← links)
- (Q3457265) (← links)
- (Q3460852) (← links)
- (Q3460891) (← links)
- From mathematical logic to programming-language semantics: a discussion with Tony Hoare (Q3465048) (← links)
- The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian (Q4995608) (← links)
- (Q5146595) (← links)