Tyler Millhouse
Biographic Data
| ID | 1178049 |
|---|---|
| NAME | Tyler Millhouse |
| GIVEN NAMES | Tyler |
| FAMILY NAME | Millhouse |
| SIGNATURE | MILLHOUSE T |
| AFFILIATIONS | University of Arizona |
| ORCID | 0000-0002-6866-2655 |
| VERIFIED | Yes |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 8 |
| AUTHOR COUNT | 3 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2019 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 2 |
Really Real Patterns
Dennett [1991] proposes a novel ontological account of the propositional attitudes—real patterns. Despite its name, the degree to which this account is committed to realism remains unclear. In this paper, I propose an alternative criterion of pattern instantiation, one that assesses the difficultly of faithfully interpreting a physical system as instantiating a particular pattern. Drawing on formal measures of simplicity and similarity, I argue t…
Compressibility and the Reality of Patterns
Daniel Dennett distinguishes real patterns from bogus patterns by appeal to compressibility. As information theorists have shown, data are compressible if and only if those data exhibit a pattern. Noting that high-level models are much simpler than their low-level counterparts, Dennett interprets high-level models as compressed representations of the fine-grained behavior of their target system. As such, he argues that high-level models depend on…
A Simplicity Criterion for Physical Computation
The aim of this article is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a ‘computational interpretation’ as an ordered pair of functions mapping (i) states of a physical system to states of an abstract machine, and (ii) inputs to this machine to interventions in this physical system. This interpretation m…
A Simplicity Criterion for Physical Computation
The aim of this article is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a ‘computational interpretation’ as an ordered pair of functions mapping (i) states of a physical system to states of an abstract machine, and (ii) inputs to this machine to interventions in this physical system. This interpretation m…
Compressibility and the Reality of Patterns
Daniel Dennett distinguishes real patterns from bogus patterns by appeal to compressibility. As information theorists have shown, data are compressible if and only if those data exhibit a pattern. Noting that high-level models are much simpler than their low-level counterparts, Dennett interprets high-level models as compressed representations of the fine-grained behavior of their target system. As such, he argues that high-level models depend on…
A Simplicity Criterion for Physical Computation
The aim of this article is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a ‘computational interpretation’ as an ordered pair of functions mapping (i) states of a physical system to states of an abstract machine, and (ii) inputs to this machine to interventions in this physical system. This interpretation m…
Compressibility and the Reality of Patterns
Daniel Dennett distinguishes real patterns from bogus patterns by appeal to compressibility. As information theorists have shown, data are compressible if and only if those data exhibit a pattern. Noting that high-level models are much simpler than their low-level counterparts, Dennett interprets high-level models as compressed representations of the fine-grained behavior of their target system. As such, he argues that high-level models depend on…
Really Real Patterns
Dennett [1991] proposes a novel ontological account of the propositional attitudes—real patterns. Despite its name, the degree to which this account is committed to realism remains unclear. In this paper, I propose an alternative criterion of pattern instantiation, one that assesses the difficultly of faithfully interpreting a physical system as instantiating a particular pattern. Drawing on formal measures of simplicity and similarity, I argue t…
Computability, Logic, AI Algorithms (3 works) · Epistemology (3 works) · Computer Science (2 works) · Evolutionary Algorithms and Applications (2 works) · Interpretation (philosophy) (2 works) · Logic, programming, and type systems (2 works) · Philosophy (2 works) · Algorithm (1 works) · Appeal (1 works) · Basis (linear algebra) (1 works)