How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (Q935029)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing |
scientific article; zbMATH DE number 5306435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing |
scientific article; zbMATH DE number 5306435 |
Statements
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (English)
0 references
31 July 2008
0 references
New experimentalism
0 references
Experimental algorithmics
0 references
Optimization
0 references
Theory of testing
0 references
Mayo's learning model
0 references
Significance
0 references
0 references
0.8266102
0 references
0.82354987
0 references
0.8223709
0 references
0.8160332
0 references
