ログイン
ユーザー名:

パスワード:


パスワード紛失

メインメニュー

logo

WEBリンク集



  メイン  |  登録する  |  人気サイト (top10)  |  高評価サイト (top10)  |  おすすめサイト (0)  |  相互リンクサイト (0)  

  カテゴリ一覧  |  RSS/ATOM 対応サイト (6)  |  RSS/ATOM 記事 (74111)  |  ランダムジャンプ  

RSS/ATOM 記事 (74111)

ここに表示されている RSS/ATOM 記事を RSS と ATOM で配信しています。


rss  atom 

文部科学省研究交流センター(つくば市)非常勤職員(時間雇用職員)採用のお知らせ  from 文部科学省 新着情報  (2016-2-9 13:21) 

第8期学術情報委員会(第6回) 配付資料  from 文部科学省 新着情報  (2016-2-9 13:21) 

馳浩文部科学大臣記者会見録(平成28年2月5日)  from 文部科学省 新着情報  (2016-2-9 13:21) 

家庭教育支援手法等に関する検討委員会(第3回)議事概要  from 文部科学省 新着情報  (2016-2-9 13:21) 

平成28年度科学技術人材育成費補助事業「卓越研究員事業の公募・審査等業務」の公募について  from 文部科学省 新着情報  (2016-2-9 13:21) 

Dutch Book Arguments  from Stanford Encyclopedia of Philosophy  (2016-2-9 12:40) 
[Revised entry by Susan Vineberg on February 8, 2016. Changes to: Main text, Bibliography] The Dutch Book argument (DBA) for probabilism (namely the view that an agent's degrees of belief should satisfy the axioms of probability) traces to Ramsey's work in "Truth and Probability". He mentioned only in passing that an agent who violates the probability axioms would be vulnerable to having a book made against him and this has led to considerable debate and confusion both about exactly what Ramsey intended to show and about if, and how, a cogent version of the argument can be given. The basic...
The Frame Problem  from Stanford Encyclopedia of Philosophy  (2016-2-9 11:43) 
[Revised entry by Murray Shanahan on February 8, 2016. Changes to: Main text, Bibliography] To most AI researchers, the frame problem is the challenge of representing the effects of action in logic without having to represent explicitly a large number of intuitively obvious non-effects. But to many philosophers, the AI researchers' frame problem is suggestive of wider epistemological issues. Is it possible, in principle, to limit the scope of the reasoning required to derive the consequences of an action? And, more generally, how do we account for our apparent ability...
The Turing Test  from Stanford Encyclopedia of Philosophy  (2016-2-9 11:35) 
[Revised entry by Graham Oppy and David Dowe on February 8, 2016. Changes to: Main text, Bibliography] The phrase "The Turing Test" is most properly used to refer to a proposal made by Turing (1950) as a way of dealing with the question whether machines can think. According to Turing, the question whether machines can think is itself "too meaningless" to deserve discussion (442). However, if we consider the more precise - and somehow related - question whether a digital computer can do well in a certain kind of game that Turing describes...
The Definition of Morality  from Stanford Encyclopedia of Philosophy  (2016-2-9 10:48) 
[Revised entry by Bernard Gert and Joshua Gert on February 8, 2016. Changes to: Main text, Bibliography] The topic of this entry is not - at least directly - moral theory; rather, it is the definition of morality. Moral theories are large and complex things; definitions are not. The question of the definition of morality is the question of identifying the target of moral theorizing. Identifying this target enables us to see different moral theories as attempting to capture the very same thing. In this way, the distinction between a definition of morality and a moral theory parallels the distinction John Rawls...
Dewey's Aesthetics  from Stanford Encyclopedia of Philosophy  (2016-2-9 10:41) 
[Revised entry by Tom Leddy on February 8, 2016. Changes to: Main text, Bibliography] John Dewey is well known for his work in logic, scientific inquiry, and philosophy of education. His fame is based largely on his membership in the school of American Pragmatists of which Charles Sanders Peirce and William James were the leading early figures. He has also had a great deal of influence in aesthetics and the philosophy of art. His work Art as Experience (1934) is regarded by many as one of the most important contributions to this area in the 20th century. Yet it is not as widely discussed...



« [1] 6678 6679 6680 6681 6682 (6683) 6684 6685 6686 6687 6688 [7412] » 
大谷大学関連のホームページ

Powered by XOOPS Cube 2.1© 2001-2006 XOOPS Cube Project