PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association最新文献_第4页

Making Sense of Approximate Decoherence 近似退相干的意义

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.1.193039

G. Bacciagaluppi, M. Hemmo

引用次数: 16

The Metaphysics of the Disunified World 《不统一世界的形而上学

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.2.192946

N. Cartwright

引用次数: 15

Circular Justifications 圆形的理由

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.1.193045

Harold I. Brown

引用次数: 12

Reasoning Strategies in Molecular Biology: Abstractions, Scans and Anomalies 分子生物学中的推理策略:抽象、扫描和异常

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.2.192928

L. Darden, Michael Cook

引用次数: 17

The Microeconomic Interpretation of Games 游戏的微观经济学解释

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.1.193042

C. LaCasse, D. Ross

引用次数: 5

Against Scientific Imperialism 反对科学帝国主义

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.2.192948

J. Dupré

引用次数: 61

The Extent of Dilation of Sets of Probabilities and the Asymptotics of Robust Bayesian Inference 概率集的展开性与稳健贝叶斯推理的渐近性

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.1.193030

T. Herron, Teddy Seidenfeld, L. Wasserman

{"title":"The Extent of Dilation of Sets of Probabilities and the Asymptotics of Robust Bayesian Inference","authors":"T. Herron, Teddy Seidenfeld, L. Wasserman","doi":"10.1086/psaprocbienmeetp.1994.1.193030","DOIUrl":"https://doi.org/10.1086/psaprocbienmeetp.1994.1.193030","url":null,"abstract":"We report two issues concerning diverging sets of Bayesian (conditional) probabilities-divergence of \"posteriors\"-that can result with increasing evidence. Consider a set P of probabilities typically, but not always, based on a set of Bayesian \"priors.\" Fix E, an event of interest, and X, a random variable to be observed. With respect to P, when the set of conditional probabilities for E, given X, strictly contains the set of unconditional probabilities for E, for each possible outcome X = x, call this phenomenon dilation of the set of probabilities (Seidenfeld and Wasserman 1993). Thus, dilation contrasts with the asymptotic merging of posterior probabilities reported by Savage (1954) and by Blackwell and Dubins (1962). (1) In a wide variety of models for Robust Bayesian inference the extent to which X dilates E is related to a model specific index of how far key elements of P are from a distribution that makes X and E independent. (2) At a fixed confidence level, (1-α), Classical interval estimates An for, e.g., a Normal mean θ have length O(n-1/2) (for sample size n). Of course, the confidence level correctly reports the (prior) probability that θ ∈ An,P(An)=1-α , independent of the prior for θ . However, as shown by Pericchi and Walley (1991), if an ε -contamination class is used for the prior on the parameter θ , there is asymptotic (posterior) dilation for the An, given the data. If, however, the intervals A′n are chosen with length $O(sqrt{log (text{n})/text{n})}$, then there is no asymptotic dilation. We discuss the asymptotic rates of dilation for ClassClassical and Bayesian interval estimates and relate these to Bayesian hypothesis testing.","PeriodicalId":288090,"journal":{"name":"PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association","volume":"436 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134085200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

Interactions among Theory, Experiment, and Technology in Molecular Biology 分子生物学理论、实验和技术之间的相互作用

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.2.192929

K. Schaffner

引用次数: 5

Who's Afraid of the Human Genome Project? 谁害怕人类基因组计划?

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.2.192941

P. Kitcher

引用次数: 5

Non-Turing Computers and Non-Turing Computability 非图灵计算机和非图灵可计算性

PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association Pub Date : 1994-01-01 DOI: 10.1086/psaprocbienmeetp.1994.1.193018

M. Hogarth

{"title":"Non-Turing Computers and Non-Turing Computability","authors":"M. Hogarth","doi":"10.1086/psaprocbienmeetp.1994.1.193018","DOIUrl":"https://doi.org/10.1086/psaprocbienmeetp.1994.1.193018","url":null,"abstract":"A true Turing machine (TM) requires an infinitely long paper tape. Thus a TM can be housed in the infinite world of Newtonian spacetime (the spacetime of common sense), but not necessarily in our world, because our world-at least according to our best spacetime theory, general relativity-may be finite. All the same, one can argue for the \"existence\" of a TM on the basis that there is no such housing problem in some other relativistic worlds that are similar (\"close\") to our world. But curiously enough-and this is the main point of this paper-some of these close worlds have a special spacetime structure that allows TMs to perform certain Turing unsolvable tasks. For example, in one kind of spacetime a TM can be used to solve first-order predicate logic and the halting problem. And in a more complicated spacetime, TMs can be used to decide arithmetic. These new computers serve to show that Church's thesis is a thoroughly contingent claim. Moreover, since these new computers share the fundamental properties of a TM in ordinary operation (e.g. intuitive, finitely programmed, limited in computational capability), a computability theory based on these non-Turing computers is no less worthy of investigation than orthodox computability theory. Some ideas about this new mathematical theory are given.","PeriodicalId":288090,"journal":{"name":"PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133683716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 145