Search results for 'effective computing' (try it on Scholar)

1000+ found
Sort by:
  1. Vincent C. Müller (2011). On the Possibilities of Hypercomputing Supertasks. Minds and Machines 21 (1):83-96.score: 45.0
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either (...)
    Direct download (13 more)  
     
    My bibliography  
     
    Export citation  
  2. Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.score: 42.0
    There is an intensive discussion nowadays about the meaning of effective computability, with implications to the status and provability of the Church–Turing Thesis (CTT). I begin by reviewing what has become the dominant account of the way Turing and Church viewed, in 1936, effective computability. According to this account, to which I refer as the Gandy–Sieg account, Turing and Church aimed to characterize the functions that can be computed by a human computer. In addition, Turing provided a highly (...)
    Direct download (18 more)  
     
    My bibliography  
     
    Export citation  
  3. Chris J. Conidis (2012). A Real of Strictly Positive Effective Packing Dimension That Does Not Compute a Real of Effective Packing Dimension One. Journal of Symbolic Logic 77 (2):447-474.score: 36.0
    Recently, the Dimension Problem for effective Hausdorff dimension was solved by J. Miller in [14], where the author constructs a Turing degree of non-integral Hausdorff dimension. In this article we settle the Dimension Problem for effective packing dimension by constructing a real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (on the other hand, it is known via [10, 3, 7] that every real of strictly positive (...) Hausdorff dimension computes reals whose effective packing dimensions are arbitrarily close to, but not necessarily equal to, one). (shrink)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Vasco Brattka & Guido Gherardi (2011). Effective Choice and Boundedness Principles in Computable Analysis. Bulletin of Symbolic Logic 17 (1):73-117.score: 31.0
    In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  5. Yongcheng Wu & Decheng Ding (2005). Computability of Measurable Sets Via Effective Metrics. Mathematical Logic Quarterly 51 (6):543-559.score: 30.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. James H. Fetzer (2000). Computing is at Best a Special Kind of Thinking. In The Proceedings of the Twentieth World Congress of Philosophy, Volume 9: Philosophy of Mind. Charlottesville: Philosophy Doc Ctr. 103-113.score: 27.0
    When computing is defined as the causal implementation of algorithms and algorithms are defined as effective decision procedures, human thought is mental computation only if it is governed by mental algorithms. An examination of ordinary thinking, however, suggests that most human thought processes are non-algorithmic. Digital machines, moreover, are mark-manipulating or string-processing systems whose marks or strings do not stand for anything for those systems, while minds are semiotic (or “signusing”) systems for which signs stand for other things (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.score: 26.0
    Horsten and Roelants have raised a number of important questions about my analysis of effective procedures and my evaluation of the Church-Turing thesis. They suggest that, on my account, effective procedures cannot enter the mathematical world because they have a built-in component of causality, and, hence, that my arguments against the Church-Turing thesis miss the mark. Unfortunately, however, their reasoning is based upon a number of misunderstandings. Effective mundane procedures do not, on my view, provide an analysis (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.score: 24.0
    Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  9. Jeremy Seligman (2002). The Scope of Turing's Analysis of Effective Procedures. Minds and Machines 12 (2):203-220.score: 24.0
    Turing's (1936) analysis of effective symbolic procedures is a model of conceptual clarity that plays an essential role in the philosophy of mathematics. Yet appeal is often made to the effectiveness of human procedures in other areas of philosophy. This paper addresses the question of whether Turing's analysis can be applied to a broader class of effective human procedures. We use Sieg's (1994) presentation of Turing's Thesis to argue against Cleland's (1995) objections to Turing machines and we evaluate (...)
    Direct download (16 more)  
     
    My bibliography  
     
    Export citation  
  10. Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2):133-148.score: 24.0
    In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired output via a possibly non-halting computation. Clearly this function gives a lower bound of the classical Kolmogorov complexity. In particular, if the machine is allowed to overwrite its output, this complexity coincides with the classical Kolmogorov complexity for halting computations relative to the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Mark Sprevak, Not All Computations Are Effective Methods.score: 24.0
    I argue in this paper that not all computations are effective methods. I consider a number of examples, and focus on those drawn from quantum computation. I consider three responses that would allow one to hold onto the claim that all computations are effective methods. I argue that none of these responses is satisfactory. I conclude that the idea motivating the claim, namely, that the class of computations can be characterised in terms of the notion of effective (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  12. Hannah Ainsworth, Mollie Gilchrist, Celia Grant, Catherine Hewitt, Sue Ford, Moira Petrie, Carole J. Torgerson & David J. Torgerson (2011). Computer-Based Instruction for Improving Student Nurses' General Numeracy: Is It Effective? Two Randomised Trials. Educational Studies 38 (2):151-163.score: 24.0
    In response to concern over the numeracy skills deficit displayed by student nurses, an online computer programme, ?Authentic World??, which aims to simulate a real-life clinical environment and improve the medication dosage calculation skills of users, was developed (Founded in 2004 Authentic World Ltd is a spin out company of Glarmorgan and Cardiff Universities, Cardiff, Wales UK.). Two randomised controlled trials were conducted, each at a UK University, in order to investigate the impact of Authentic World? on student nurses? general (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.score: 23.0
  14. Anthony F. Beavers (2011). Recent Developments in Computing and Philosophy. Journal for General Philosophy of Science 42 (2):385-397.score: 22.0
    Because the label "computing and philosophy" can seem like an ad hoc attempt to tie computing to philosophy, it is important to explain why it is not, what it studies (or does) and how it differs from research in, say, "computing and history," or "computing and biology". The American Association for History and Computing is "dedicated to the reasonable and productive marriage of history and computer technology for teaching, researching and representing history through scholarship and (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  15. Carol E. Cleland (2002). On Effective Procedures. Minds and Machines 12 (2):159-179.score: 21.0
    Since the mid-twentieth century, the concept of the Turing machine has dominated thought about effective procedures. This paper presents an alternative to Turing's analysis; it unifies, refines, and extends my earlier work on this topic. I show that Turing machines cannot live up to their billing as paragons of effective procedure; at best, they may be said to provide us with mere procedure schemas. I argue that the concept of an effective procedure crucially depends upon distinguishing procedures (...)
    Direct download (17 more)  
     
    My bibliography  
     
    Export citation  
  16. Eli Dresner (2012). Turing, Matthews and Millikan: Effective Memory, Dispositionalism and Pushmepullyou Mental States. International Journal of Philosophical Studies 20 (4):461-472.score: 21.0
    Abstract In the first section of the paper I present Alan Turing?s notion of effective memory, as it appears in his 1936 paper ?On Computable Numbers, With an Application to The Entscheidungsproblem?. This notion stands in surprising contrast with the way memory is usually thought of in the context of contemporary computer science. Turing?s view (in 1936) is that for a computing machine to remember a previously scanned string of symbols is not to store an internal symbolic image (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. David Hitchcock (2004). The Effectiveness of Computer Assisted Instruction in Critical Thinking. Informal Logic 24 (3).score: 21.0
    278 non-freshman university students taking a l2-week critical thinking course in a large single-section class, with computer-assisted guided practice as a replacement for small-group discussion, and all testing in machine-scored multiple-choice format, improved their critical thinking skills, as measured by the California Critical Thinking Skills Test (Forms A and B), by half a standard deviation, a moderate improvement. The improvement was more than that reported with a traditional format without computer-assisted instruction, but less than that reported with a format using (...)
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  18. Jens Blanck, Viggo Stoltenberg‐Hansen & John V. Tucker (2011). Stability of Representations of Effective Partial Algebras. Mathematical Logic Quarterly 57 (2):217-231.score: 21.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. Carol E. Cleland (2002). 'Turing Limit'. Some of Them (Steinhart, Copeland) Represent Extensions of Tur-Ing's Account, Whereas Others Defend Alternatives Notions of Effective Computability (Bringsjord and Zenzen, Wells). Minds and Machines 12:157-158.score: 21.0
  20. Chris Hables Gray (1988). The Strategic Computing Program at Four Years: Implications and Intimations. [REVIEW] AI and Society 2 (2):141-149.score: 21.0
    Examining the Strategic Computing Program after four years, in the context of the crucial recognition that it is only a small part of the whole range of military artificial intelligence applications, suggests a number of clear implications and intimations about such crucial questions as: 1) the current roles of industry and the universities in developing high technology war; 2) the effects on political and military policy of high-tech weapons systems; and 3) the importance of advanced military computing to (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Timothy H. McNicholl (2013). Computing Links and Accessing Arcs. Mathematical Logic Quarterly 59 (1‐2):101-107.score: 21.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22. Takakazu Mori, Mariko Yasugi & Yoshiki Tsujii (2008). Effective Fine‐Convergence of Walsh‐Fourier Series. Mathematical Logic Quarterly 54 (5):519-534.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  23. Patrick Suppes (1958). Review: Michael O. Rabin, Effective Computability of Winning Strategies. [REVIEW] Journal of Symbolic Logic 23 (2):224-224.score: 21.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Rodney Van Meter (forthcoming). Quantum Computing's Classical Problem, Classical Computing's Quantum Problem. Foundations of Physics:1-10.score: 21.0
    Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classical computers can already do. At the (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Vasco Brattka (2005). Effective Borel Measurability and Reducibility of Functions. Mathematical Logic Quarterly 51 (1):19-44.score: 21.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  26. Wesley Calvert (forthcoming). On Three Notions of Effective Computation Over R. Logic Journal of the Igpl.score: 21.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  27. Jane Coughlan & Stephen Swift (2011). Student and Tutor Perceptions of Learning and Teaching on a First‐Year Study Skills Module in a University Computing Department. Educational Studies 37 (5):529-539.score: 21.0
    The level of student preparedness for university?level study has been widely debated. Effective study skills modules have been linked to supporting students? academic development during the transition phase. However, few studies have evaluated the learning experience on study skills modules from both a student and staff perspective. We surveyed 121 first?year students and seven tutors on a study skills module on an undergraduate computing programme. The aspects in which the students? and tutors? views diverge provide insights into the (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Shagrir Oron (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2).score: 21.0
  29. Alexandra A. Soskova (1997). Effective Structures. Mathematical Logic Quarterly 43 (2):235-250.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Clifford Spector (1959). Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW] Journal of Symbolic Logic 24 (1):70-70.score: 21.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  31. Ralph J. Teutsch & Dale W. Jamieson (1974). Hockett on Effective Computability. Foundations of Language 11 (2):287-293.score: 21.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. Yongcheng Wu & Decheng Ding (2006). Computability of Measurable Sets Via Effective Topologies. Archive for Mathematical Logic 45 (3):365-379.score: 21.0
    We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. C. E. M. Yates (1971). Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW] Journal of Symbolic Logic 36 (1):141-146.score: 21.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  34. Vincent A. W. M. M. Aleven & Kenneth R. Koedinger (2002). An Effective Metacognitive Strategy: Learning by Doing and Explaining with a Computer‐Based Cognitive Tutor. Cognitive Science 26 (2):147-179.score: 20.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. Tim Button (2009). Hyperloops Do Not Threaten the Notion of an Effective Procedure. Lecture Notes in Computer Science 5635:68-78.score: 19.0
    This paper develops my (BJPS 2009) criticisms of the philosophical significance of a certain sort of infinitary computational process, a hyperloop. I start by considering whether hyperloops suggest that "effectively computable" is vague (in some sense). I then consider and criticise two arguments by Hogarth, who maintains that hyperloops undermine the very idea of effective computability. I conclude that hyperloops, on their own, cannot threaten the notion of an effective procedure.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  36. Jonathan Bain (2013). Emergence in Effective Field Theories. European Journal for Philosophy of Science 3 (3):257-273.score: 18.0
    This essay considers the extent to which a concept of emergence can be associated with Effective Field Theories (EFTs). I suggest that such a concept can be characterized by microphysicalism and novelty underwritten by the elimination of degrees of freedom from a high-energy theory, and argue that this makes emergence in EFTs distinct from other concepts of emergence in physics that have appeared in the recent philosophical literature.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  37. Surendra Arjoon (2006). Striking a Balance Between Rules and Principles-Based Approaches for Effective Governance: A Risks-Based Approach. [REVIEW] Journal of Business Ethics 68 (1):53 - 82.score: 18.0
    Several recent studies and initiatives have emphasized the importance of a strong ethical organizational DNA (ODNA) to create and promote an effective corporate governance culture of trust, integrity and intellectual honesty. This paper highlights the drawbacks of an excessively heavy reliance on rules-based approaches that increase the cost of doing business, overshadow essential elements of good corporate governance, create a culture of dependency, and can result in legal absolutism. The paper makes the case that the way forward for (...) corporate governance is to strike an optimal balance between rules-based and principles-based approaches. The recent corporate scandals have demonstrated that the ethical ODNA is critical to the driving force and basis of legal and regulatory requirements. Effective governance means adhering to ethical principles, not merely complying with rules, and is a crucial guardian of a firm’s reputation and integrity. It is through an effective corporate governance program (that is, one that optimally captures and integrates the appropriate aspects of rules-based and principles-based approaches, and identifies and assesses the related risks) that an organization can reconfigure its ODNA for improved performance. Focusing on the ethical ODNA as the basis of new governance measures provides an opportunity to develop a competitive advantage as it represents a potential source of differentiation, strengthens the relationship with all stakeholders of the organization by building a culture of trust and integrity, and re-instills investor confidence. This paper employs dialectical reasoning that links the ODNA through principles-driven rules in developing a risks-based approach. A comparison from a risk assessment perspective between rules-based and principles-based approaches is presented. Although there have been few applications employing dialectical reasoning in business research, this methodology can be extremely useful in isolating ethical issues and integrating them into the business process. The risks-based approach captures the benefits of both rules-based and principles-based approaches, and incorporates trust-based principles such␣as solidarity, subsidiarity and covenantal relationships. (shrink)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Matti Tedre (2011). Computing as a Science: A Survey of Competing Viewpoints. [REVIEW] Minds and Machines 21 (3):361-387.score: 18.0
    Since the birth of computing as an academic discipline, the disciplinary identity of computing has been debated fiercely. The most heated question has concerned the scientific status of computing. Some consider computing to be a natural science and some consider it to be an experimental science. Others argue that computing is bad science, whereas some say that computing is not a science at all. This survey article presents viewpoints for and against computing as (...)
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  39. Soraj Hongladarom (2013). Ubiquitous Computing, Empathy and the Self. AI and Society 28 (2):227-236.score: 18.0
    The paper discusses ubiquitous computing and the conception of the self, especially the question how the self should be understood in the environment pervaded by ubiquitous computing, and how ubiquitous computing makes possible direct empathy where each person or self connected through the network has direct access to others’ thoughts and feelings. Starting from a conception of self, which is essentially distributed, composite and constituted through information, the paper argues that when a number of selves are connected (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Edward J. O'Boyle (2002). An Ethical Decision-Making Process for Computing Professionals. Ethics and Information Technology 4 (4):267-277.score: 18.0
    Our comments focus on the ACMCode of Ethics and situate the Code within ageneral ethical decision-making process tospecify the five steps which logically precedehuman action in ethical matters and determinethat action, and the individual differencetraits in these five steps which bear upon theresolution of an ethical problem and lead tomorally responsible action. Our main purpose isto present a cognitive moral processing modelwhich computing professionals can use to betterunderstand their professional rights andduties. It is clear that the Code providessubstantial guidance (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  41. Merle Spriggs (2008). The Ethics of Research on Less Expensive, Less Effective Interventions: A Case for Analysis. [REVIEW] Journal of Bioethical Inquiry 5 (4):295-302.score: 18.0
    The Kennedy Krieger lead paint study is a landmark case in human experimentation and a classic case in research ethics. In this paper I use the lead paint study to assist in the analysis of the ethics of research on less expensive, less effective interventions. I critically evaluate an argument by Buchanan and Miller who defend both the Kennedy Krieger lead paint study and public health research on less expensive, less effective interventions. I conclude that Buchanan and Miller’s (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  42. Lukáš Sekanina (2007). Evolved Computing Devices and the Implementation Problem. Minds and Machines 17 (3):311-329.score: 18.0
    The evolutionary circuit design is an approach allowing engineers to realize computational devices. The evolved computational devices represent a distinctive class of devices that exhibits a specific combination of properties, not visible and studied in the scope of all computational devices up till now. Devices that belong to this class show the required behavior; however, in general, we do not understand how and why they perform the required computation. The reason is that the evolution can utilize, in addition to the (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  43. Baojuan Li, Xiang Wang, Shuqiao Yao, Dewen Hu & Karl Friston (2012). Task-Dependent Modulation of Effective Connectivity Within the Default Mode Network. Frontiers in Psychology 3.score: 18.0
    The default mode network (DMN) has recently attracted widespread interest. Previous studies have found that task-related processing can induce deactivation and changes in the functional connectivity of this network. However, it remains unclear how tasks modulate the underlying effective connectivity within the DMN. Using recent advances in dynamic causal modeling (DCM), we investigated the modulatory effect of (gender judgment) task performance on directed connectivity within the DMN. Sixteen healthy subjects were scanned twice: at rest and while performing a gender (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  44. Uri Pincas (2011). Program Verification and Functioning of Operative Computing Revisited: How About Mathematics Engineering? [REVIEW] Minds and Machines 21 (2):337-359.score: 18.0
    The issue of proper functioning of operative computing and the utility of program verification, both in general and of specific methods, has been discussed a lot. In many of those discussions, attempts have been made to take mathematics as a model of knowledge and certitude achieving, and accordingly infer about the suitable ways to handle computing. I shortly review three approaches to the subject, and then take a stance by considering social factors which affect the epistemic status of (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  45. Chaudhary Imran Sarwar (2013). Future of Ethically Effective Leadership. Journal of Business Ethics 113 (1):81-89.score: 18.0
    This research focuses on (a) introducing and exploring ethically effective leadership, (b) introducing and testing theory on triad of typical–maximal–ideal ethically effective leadership performances, (b) theorizing and empirically testing that each of typical–maximal–ideal ethically effective leadership performance is different from each others, in other words exploring mean differences between each pair of typical–maximal–ideal effective leadership performances, (c) introducing, theorizing, and testing mechanism to quantify respondents’ intrinsic desire and inherent potential to enhance their ethically effective leadership (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  46. Albert R. Meyer & Patrick C. Fischer (1972). Computational Speed-Up by Effective Operators. Journal of Symbolic Logic 37 (1):55-68.score: 18.0
  47. Robert Rosenberger (2013). The Importance of Generalized Bodily Habits for a Future World of Ubiquitous Computing. AI and Society 28 (3):289-296.score: 18.0
    In a future world of ubiquitous computing, in which humans interact with computerized technologies even more frequently and in even more situations than today, interface design will have increased importance. One feature of interface that I argue will be especially relevant is what I call abstract relational strategies. This refers to an approach (in both a bodily and conceptual sense) toward the use of a technology, an approach that is general enough to be applied in many different concrete scenarios. (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. Karl Friston Baojuan Li, Xiang Wang, Shuqiao Yao, Dewen Hu (2012). Task-Dependent Modulation of Effective Connectivity Within the Default Mode Network. Frontiers in Psychology 3.score: 18.0
    The default mode network (DMN) has recently attracted widespread interest. Previous studies have found that task-related processing can induce deactivation and changes in the functional connectivity of this network. However, it remains unclear how tasks modulate the underlying effective connectivity within the DMN. Using recent advances in dynamic causal modeling (DCM), we investigated the modulatory effect of (gender judgment) task performance on directed connectivity within the DMN. Sixteen healthy subjects were scanned twice: at rest and while performing a gender (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. Thomas Fuß (2002). SU(3) Local Gauge Field Theory as Effective Dynamics of Composite Gluons. Foundations of Physics 32 (11):1737-1755.score: 18.0
    The effective dynamics of quarks is described by a nonperturbatively regularized NJL model equation with canonical quantization and probability interpretation. The quantum theory of this model is formulated in functional space and the gluons are considered as relativistic bound states of colored quark-antiquark pairs. Their wave functions are calculated as eigenstates of hardcore equations, and their effective dynamics is derived by weak mapping in functional space. This leads to the phenomenological SU(3) gauge invariant gluon equations in functional formulation, (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  50. Viola Schiaffonati & Mario Verdicchio (forthcoming). Computing and Experiments. Philosophy and Technology:1-18.score: 18.0
    The question about the scientific nature of computing has been widely debated with no universal consensus reached about its disciplinary status. Positions vary from acknowledging computing as the science of computers to defining it as a synthetic engineering discipline. In this paper, we aim at discussing the nature of computing from a methodological perspective. We consider, in particular, the nature and role of experiments in this field, whether they can be considered close to the traditional experimental scientific (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000