首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 40 毫秒
1.
In their joint paper entitled “The Replication of the Hard Problem of Consciousness in AI and BIO-AI” (Boltuc et al. Replication of the hard problem of conscious in AI and Bio- AI: An early conceptual framework 2008), Nicholas and Piotr Boltuc suggest that machines could be equipped with phenomenal consciousness, which is subjective consciousness that satisfies Chalmer’s hard problem (We will abbreviate the hard problem of consciousness as “H-consciousness”). The claim is that if we knew the inner workings of phenomenal consciousness and could understand its’ precise operation, we could instantiate such consciousness in a machine. This claim, called the extra-strong AI thesis, is an important claim because if true it would demystify the privileged access problem of first-person consciousness and cast it as an empirical problem of science and not a fundamental question of philosophy. A core assumption of the extra-strong AI thesis is that there is no logical argument that precludes the implementation of H-consciousness in an organic or in-organic machine provided we understand its algorithm. Another way of framing this conclusion is that there is nothing special about H-consciousness as compared to any other process. That is, in the same way that we do not preclude a machine from implementing photosynthesis, we also do not preclude a machine from implementing H-consciousness. While one may be more difficult in practice, it is a problem of science and engineering, and no longer a philosophical question. I propose that Boltuc’s conclusion, while plausible and convincing, comes at a very high price; the argument given for his conclusion does not exclude any conceivable process from machine implementation. In short, if we make some assumptions about the equivalence of a rough notion of algorithm and then tie this to human understanding, all logical preconditions vanish and the argument grants that any process can be implemented in a machine. The purpose of this paper is to comment on the argument for his conclusion and offer additional properties of H-consciousness that can be used to make the conclusion falsifiable through scientific investigation rather than relying on the limits of human understanding.  相似文献   

2.
3.
4.
The paper [1] purports to present a classification of the general failure sets of logic programs and a simple proof of the theorem on the soundness and completeness of the negation-as-failure rule. In this note we clarify some conflicting terminology between [1] and the papers [2, 3] to which it predominantly refers. Our main purpose, however, is to point out major errors, in particular, one in the proof of the above mentioned theorem.  相似文献   

5.
Abstract:

Most of school science concentrates on helping students gain a knowledge and understanding of explicit science, which may subsequently be tested in examinations. It presents a picture of science as a secure body of knowledge, gained by scientists working according to the standard procedures of science. In this paper I stress a different model of science: the looseness of the knowledge held, the idiosyncratic methods by which it is obtained, and the personal way in which it is used to solve problems. I also stress the importance of tacit knowledge and the affective driving force, which describe the personal knowledge that scientists both hold and utilize; I analyse the nature of authentic science in terms of the type of knowledge that scientists know and the way in which scientists work. The arguments for and against such authentic science in schools are considered, together with the factors limiting its practicality. Influenced by the writing of Polanyi, Hodgkin, and Claxton and by experience of, and researches into, students doing problem‐solving projects in schools, I argue that it is desirable, and possible, to incorporate some such authentic science into the school science curriculum. In spite of many unsympathetic pressures acting on current schooling, I believe that there is a vital need to reaffirm the importance of the tacit and the affective in school science.  相似文献   

6.
7.
8.
《Automatica》1986,22(2):255-256
The parametric model used by Zhu and Wan for expressing survival rate as a function of age can be replaced by a simpler model without discernable loss of accuracy. The parameters of this simpler model are subject to easy interpretation.  相似文献   

9.
10.
Samal and Henderson claim that any parallel algorithm for enforcing arc consistency in the worst case must have (na) sequential steps, wheren is the number of nodes, anda is the number of labels per node. We argue that Samal and Henderson's argument makes assumptions about how processors are used and give a counterexample that enforces arc consistency in a constant number of steps usingO(n[su2a22na) processors. It is possible that the lower bound holds for a polynomial number of processors; if such a lower bound were to be proven it would answer an important open question in theoretical computer science concerning the relation between the complexity classesP andNC. The strongest existing lower bound for the arc consistency problem states that it cannot be solved in polynomial log time unlessP=NC.  相似文献   

11.
Marvi et al(Science,2014,vol.346,p.224)concluded a sidewinder rattlesnake increases the body contact length with the sand when granular incline angle increases.They also claimed the same principle should work on robotic snake too.We have evidence to prove that this conclusion is only partial in describing the snake body-sand interaction.There should be three phases that fully represent the snake locomotion behaviors during ascent of sandy slopes,namely lifting,descending,and ceasing.The snake body-sand interaction during the descending and ceasing phases helps with the climbing while such interaction during the lifting phase in fact contributes resistance.  相似文献   

12.
In view of the singular nature of the letter by Johnson (1970), the following comments are made on the various sections of Johnson's letter seriatim, starting with Johnson's summary:

(a)The procedure described by Porter (1969) is not a procedure “for synthesizing a linear feedback control law which will realize a certain pre selected closed-loop eigenvalue pattern for a linear dynamical system”. It is concerned (Porter 1969) “with the application of the direct method of Liapunov” to the problem of assigning the closed-loop eigenvalues “in such a way that asymptotic stability or a sufficient margin of absolute stability is achieved”.

(b)In view of comment 0 (a), it is difficult to divine the intended meaning of the statement: “In addition, another method is proposed” (Johnson 1970).  相似文献   

13.
14.
15.
16.
The problem of constructing an observer for a discrete linear system so as to minimize a quadratic function of the state estimation error is considered. The choice of a particular canonical representation for the system is shown to lead to a simple design procedure. The resulting observer is shown also to possess the minimum-time state-estimation property.  相似文献   

17.
The development of information technology, such as iPad applications, facilitates the implementation of constructivist teaching methods. Thus, the present study developed a “prediction–observation–explanation” (POE) inquiry-based learning mode to teach science concepts using the iPad2. The study used the “attention-to-affect” model with a self-report measure to determine the antecedent factor – Internet cognitive failure – related to learning interest based on students' continuance intentions to practice POE inquiry using the iPad2. A total of 96 elementary 6th grade students participated in the study and completed the questionnaires, of which 81 effective questionnaires were validated for the confirmatory factor analysis with structural equation modeling. The results of this study indicated that Internet cognitive failure was negatively associated with three types of learning interest as indicated by high levels of liking, enjoyment, and engagement. On the other hand, three types of learning interest were positively correlated to continuance learning through iPad2 interactions. The results suggested that the POE mode of inquiry is suitable for implementing at an intelligent mobile device to enhance young students' interest and continuance intentions with respect to the learning of science.  相似文献   

18.
19.
Environmental conditions and the interplay of cognitive and affective processes both exert influences on bidding behavior. This paper brings the above together, considering how the (external) auction environment determines the impact of (internal) cognitive and affective processes on bidding behavior, assessed in comparison to the optimal bid. Two aspects of the auction environment were considered, namely auction dynamics (low: first-price sealed-bid auction, high: Dutch auction) and value uncertainty (low, high). In a laboratory experiment, we assess bidders’ cognitive workload and emotional arousal through physiological measurements. We find that higher auction dynamics increase the impact of emotional arousal on bid deviations, but not that of cognitive workload. Higher value uncertainty, conversely, increases the impact of cognitive workload on bid deviations, but not that of emotional arousal. Taken together, the auction environment is a critical factor in understanding the nature of the underlying decision process and its impact on bids.  相似文献   

20.
In a very recent paper, Peng and Liu (Neural Comput Appl 20:543–547, 2011) investigated the pth moment stability of the stochastic Grossberg–Hopfield neural networks with Markov volatilities by Mao et al. (Bernoulli 6:73–90, 2000, Theorem 4.1). We should point out that Mao et al. (Bernoulli 6:73–90, 2000, Theorem 4.1) investigated the pth moment exponentially stable for a class of stochastic dynamical systems with constant delay; however, this theorem cannot apply to the case of variable time delays. It is also worthy to emphasize that Peng and Liu (Neural Comput Appl 20:543–547, 2011) discussed by Mao et al. (Bernoulli 6:73–90, 2000, Theorem 4.1) the pth moment exponentially stable for the Grossberg–Hopfield neural networks with variable delays, and therefore, there are some gaps between Peng and Liu (Neural Comput Appl 20:543–547, 2011, Theorem 1) and Mao et al. (Bernoulli 6:73–90, 2000, Theorem 4.1). In this paper, we fill up this gap. Moreover, a numerical example is also provided to demonstrate the effectiveness and applicability of the theoretical results.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号