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: 90.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: 72.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: 60.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. 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: 54.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  
  5. Vasco Brattka & Guido Gherardi (2011). Effective Choice and Boundedness Principles in Computable Analysis. Bulletin of Symbolic Logic 17 (1):73-117.score: 52.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  
  6. Yongcheng Wu & Decheng Ding (2005). Computability of Measurable Sets Via Effective Metrics. Mathematical Logic Quarterly 51 (6):543-559.score: 50.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.score: 44.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. Anthony F. Beavers (2011). Recent Developments in Computing and Philosophy. Journal for General Philosophy of Science 42 (2):385-397.score: 44.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  
  9. 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: 42.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  
  10. Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2):133-148.score: 42.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. Eli Dresner (2012). Turing, Matthews and Millikan: Effective Memory, Dispositionalism and Pushmepullyou Mental States. International Journal of Philosophical Studies 20 (4):461-472.score: 42.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  
  12. David Hitchcock (2004). The Effectiveness of Computer Assisted Instruction in Critical Thinking. Informal Logic 24 (3).score: 42.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  
  13. Timothy H. McNicholl (2013). Computing Links and Accessing Arcs. Mathematical Logic Quarterly 59 (1‐2):101-107.score: 42.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  14. 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: 42.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  
  15. Mark Sprevak, Not All Computations Are Effective Methods.score: 40.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  
  16. 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: 40.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  
  17. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.score: 40.0
  18. Jeremy Seligman (2002). The Scope of Turing's Analysis of Effective Procedures. Minds and Machines 12 (2):203-220.score: 36.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  
  19. William W. Graves Olga Boukrina (2013). Neural Networks Underlying Contributions From Semantics in Reading Aloud. Frontiers in Human Neuroscience 7.score: 36.0
    Reading is an essential part of modern society, yet much is still unknown about the physiological underpinnings of its information processing components. Two influential cognitive models of reading, the connectionist and dual-route cascaded models, offer very different accounts, yet evidence for one or the other remains equivocal. These models differ in several ways, including the role of semantics (word meaning) in mapping spelling to sound. We used a new effective connectivity algorithm, IMaGES, to provide a network-level perspective on these (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  20. Nelson Oly Ndubisi (2007). Customers' Perceptions and Intention to Adopt Internet Banking: The Moderation Effect of Computer Self-Efficacy. [REVIEW] AI and Society 21 (3):315-327.score: 36.0
    In the past, the conventional concentration of Internet banking (IB) research has been on technology development, but this is now shifting to user-focused research. It has been suggested that potential users of IB services in Malaysia may not adopt the system even if they are available, due to their perceptions of this application and their level of confidence in using it to solve their banking needs. This study therefore employs the extended technology acceptance model as the theoretical framework for assessing (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. 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: 36.0
  22. Patrick Suppes (1958). Review: Michael O. Rabin, Effective Computability of Winning Strategies. [REVIEW] Journal of Symbolic Logic 23 (2):224-224.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Vasco Brattka (2008). Borel Complexity and Computability of the Hahn–Banach Theorem. Archive for Mathematical Logic 46 (7-8):547-564.score: 36.0
    The classical Hahn–Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari Downey, Ishihara and others and it is known that the theorem does not admit a general computable version. We prove a new computable version of this theorem without unrolling the classical proof of the (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Wesley Calvert (forthcoming). On Three Notions of Effective Computation Over R. Logic Journal of the Igpl.score: 36.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Shagrir Oron (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2).score: 36.0
  26. Clifford Spector (1959). Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW] Journal of Symbolic Logic 24 (1):70-70.score: 36.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  27. Ralph J. Teutsch & Dale W. Jamieson (1974). Hockett on Effective Computability. Foundations of Language 11 (2):287-293.score: 36.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  28. Yongcheng Wu & Decheng Ding (2006). Computability of Measurable Sets Via Effective Topologies. Archive for Mathematical Logic 45 (3):365-379.score: 36.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  
  29. 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: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. 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: 34.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  31. Nicholas Furl, P. Jonathon Phillips & Alice J. O'Toole (2002). Face Recognition Algorithms and the Other‐Race Effect: Computational Mechanisms for a Developmental Contact Hypothesis. Cognitive Science 26 (6):797-815.score: 34.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. Joseph Dreitlein (1993). The Unreasonable Effectiveness of Computer Physics. Foundations of Physics 23 (6):923-930.score: 32.0
    Computers provide tools suprisingly effective in analyzing physical processes. The interaction of analytical and computer methods of physical research has been synergistic. Examples are given of the conceptual advances which have been spurred by the interaction of computer and classical analysis. It is argued that a new age in physical research is beginning and that the power of computer tools has scarcely been tapped.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Takakazu Mori, Mariko Yasugi & Yoshiki Tsujii (2008). Effective Fine‐Convergence of Walsh‐Fourier Series. Mathematical Logic Quarterly 54 (5):519-534.score: 32.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  34. Jens Blanck, Viggo Stoltenberg‐Hansen & John V. Tucker (2011). Stability of Representations of Effective Partial Algebras. Mathematical Logic Quarterly 57 (2):217-231.score: 32.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  35. Vasco Brattka (2005). Effective Borel Measurability and Reducibility of Functions. Mathematical Logic Quarterly 51 (1):19-44.score: 32.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  36. Christine L. MacKenzie & Evan D. Graham (1997). Separating a and W Effects: Pointing to Targets on Computer Displays. Behavioral and Brain Sciences 20 (2):316-318.score: 32.0
    We address two main issues: the distinction between time-constrained and spatially constrained tasks, and the separable A and W effects on movement time (MT) in spatially-constrained tasks. We consider MT and 3-D kinematic data from human adults pointing to targets in human-computer interaction. These are better fit by Welford's (1968) two-part model, than Fitts' (1954; Fitts & Peterson 1964) ID model. We identify theoretical and practical implications.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  37. Alexandra A. Soskova (1997). Effective Structures. Mathematical Logic Quarterly 43 (2):235-250.score: 32.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  38. Lorenz M. Hilty, Andreas Köhler, Fabian Schéele, Rainer Zah & Thomas Ruddy (2006). Rebound Effects of Progress in Information Technology. Poiesis and Praxis 4 (1):19-38.score: 30.0
    Information technology (IT) is continuously making astounding progress in technical efficiency. The time, space, material and energy needed to provide a unit of IT service have decreased by three orders of magnitude since the first personal computer (PC) was sold. However, it seems difficult for society to translate IT’s efficiency progress into progress in terms of individual, organizational or socio-economic goals. In particular it seems to be difficult for individuals to work more efficiently, for organizations to be more productive and (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  39. Carol E. Cleland (2002). On Effective Procedures. Minds and Machines 12 (2):159-179.score: 30.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  
  40. Wilfried Sieg, Church Without Dogma: Axioms for Computability.score: 30.0
    Church's and Turing's theses dogmatically assert that an informal notion of effective calculability is adequately captured by a particular mathematical concept of computability. I present an analysis of calculability that is embedded in a rich historical and philosophical context, leads to precise concepts, but dispenses with theses. To investigate effective calculability is to analyze symbolic processes that can in principle be carried out by calculators. This is a philosophical lesson we owe to Turing. Drawing on that lesson and (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Shyam B. Bhandari (1997). Some Ethical Issues in Computation and Disclosure of Interest Rate and Cost of Credit. Journal of Business Ethics 16 (5):531-535.score: 30.0
    Although the mathematics of interest is very precise, the practice of charging computing and disclosing interest or cost of credit is full of variations and therefore often questionable on ethical grounds. The purpose of this paper is to examine some of the prevalent practices which are incorrect, illogical, unfair or deceptive. Both utilitarian and formalist schools of ethical theory would find these practices to be inappropriate. The paper will specifically look at unfair practices in the areas of estimation of (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  42. Albert R. Meyer & Patrick C. Fischer (1972). Computational Speed-Up by Effective Operators. Journal of Symbolic Logic 37 (1):55-68.score: 30.0
  43. Stefan Huber, Korbinian Moeller, Hans-Christoph Nuerk & Klaus Willmes (2013). A Computational Modeling Approach on Three‐Digit Number Processing. Topics in Cognitive Science 5 (2):317-334.score: 30.0
    Recent findings indicate that the constituting digits of multi-digit numbers are processed, decomposed into units, tens, and so on, rather than integrated into one entity. This is suggested by interfering effects of unit digit processing on two-digit number comparison. In the present study, we extended the computational model for two-digit number magnitude comparison of Moeller, Huber, Nuerk, and Willmes (2011a) to the case of three-digit number comparison (e.g., 371_826). In a second step, we evaluated how hundred-decade and hundred-unit compatibility effects (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. Tim Button (2009). Hyperloops Do Not Threaten the Notion of an Effective Procedure. Lecture Notes in Computer Science 5635:68-78.score: 30.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  
  45. Abbas Edalat (1997). Domains for Computation in Mathematics, Physics and Exact Real Arithmetic. Bulletin of Symbolic Logic 3 (4):401-452.score: 30.0
    We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  46. Lex Hendriks (1999). Effective Logic Computation, Klaus Truemper. Journal of Logic, Language and Information 8 (4):481-484.score: 30.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  47. Rodney Van Meter (forthcoming). Quantum Computing's Classical Problem, Classical Computing's Quantum Problem. Foundations of Physics:1-10.score: 30.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  
  48. Chris Hables Gray (1988). The Strategic Computing Program at Four Years: Implications and Intimations. [REVIEW] AI and Society 2 (2):141-149.score: 30.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  
  49. Armin Hemmerling (2006). The Hausdorff-Ershov Hierarchy in Euclidean Spaces. Archive for Mathematical Logic 45 (3):323-350.score: 30.0
    The topological arithmetical hierarchy is the effective version of the Borel hierarchy. Its class Δta 2 is just large enough to include several types of pointsets in Euclidean spaces ℝ k which are fundamental in computable analysis. As a crossbreed of Hausdorff's difference hierarchy in the Borel class ΔB 2 and Ershov's hierarchy in the class Δ0 2 of the arithmetical hierarchy, the Hausdorff-Ershov hierarchy introduced in this paper gives a powerful classification within Δta 2. This is based on (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  50. Vladeta Vučković (1970). Effective Enumerability of Some Families of Partially Recursive Functions Connected With Computable Functionals. Mathematical Logic Quarterly 16 (2):113-121.score: 30.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000