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

1000+ found
Sort by:
  1. Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.score: 96.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  
  2. 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  
  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: 80.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: 72.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: 70.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: 66.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: 64.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. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.score: 64.0
  9. Mark Sprevak, Not All Computations Are Effective Methods.score: 60.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  
  10. 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: 60.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  
  11. 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: 60.0
  12. Patrick Suppes (1958). Review: Michael O. Rabin, Effective Computability of Winning Strategies. [REVIEW] Journal of Symbolic Logic 23 (2):224-224.score: 60.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Wesley Calvert (forthcoming). On Three Notions of Effective Computation Over R. Logic Journal of the Igpl.score: 60.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Shagrir Oron (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2).score: 60.0
  15. Clifford Spector (1959). Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW] Journal of Symbolic Logic 24 (1):70-70.score: 60.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  16. Ralph J. Teutsch & Dale W. Jamieson (1974). Hockett on Effective Computability. Foundations of Language 11 (2):287-293.score: 60.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. 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: 60.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. David Hitchcock (2004). The Effectiveness of Computer Assisted Instruction in Critical Thinking. Informal Logic 24 (3).score: 58.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  
  19. Anthony F. Beavers (2011). Recent Developments in Computing and Philosophy. Journal for General Philosophy of Science 42 (2):385-397.score: 56.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  
  20. Yongcheng Wu & Decheng Ding (2006). Computability of Measurable Sets Via Effective Topologies. Archive for Mathematical Logic 45 (3):365-379.score: 56.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  
  21. Eli Dresner (2012). Turing, Matthews and Millikan: Effective Memory, Dispositionalism and Pushmepullyou Mental States. International Journal of Philosophical Studies 20 (4):461-472.score: 54.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  
  22. Timothy H. McNicholl (2013). Computing Links and Accessing Arcs. Mathematical Logic Quarterly 59 (1‐2):101-107.score: 54.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  23. 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: 54.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. 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: 54.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. 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: 54.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  
  26. 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: 52.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  
  27. Albert R. Meyer & Patrick C. Fischer (1972). Computational Speed-Up by Effective Operators. Journal of Symbolic Logic 37 (1):55-68.score: 50.0
  28. Lex Hendriks (1999). Effective Logic Computation, Klaus Truemper. Journal of Logic, Language and Information 8 (4):481-484.score: 50.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  29. 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: 50.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Martin Ziegler (2012). Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Effective Linear Algebra. Annals of Pure and Applied Logic 163 (8):1108-1139.score: 50.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  31. Blair C. Armstrong & David C. Plaut (2008). Settling Dynamics in Distributed Networks Explain Task Differences in Semantic Ambiguity Effects: Computational and Behavioral Evidence. In B. C. Love, K. McRae & V. M. Sloutsky (eds.), Proceedings of the 30th Annual Conference of the Cognitive Science Society. Cognitive Science Society. 273--278.score: 50.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. G. Brooks, J. N. V. Miles, C. J. Torgerson & D. J. Torgerson (2006). Is an Intervention Using Computer Software Effective in Literacy Learning? A Randomised Controlled Trial. Educational Studies 32 (2):133-143.score: 50.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  33. M. Freund (1994). A Minimal Logical System for Computable Concepts and Effective Knowability. Logique Et Analyse 34 (4):339-66.score: 50.0
     
    My bibliography  
     
    Export citation  
  34. Merrill Garrett & Edgar Zurif (1979). Neurolinguistics Must Be More Experimental Before It Can Be Effectively Computational. Behavioral and Brain Sciences 2 (3):465-466.score: 50.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  35. John P. Helm (1971). On Effectively Computable Operators. Mathematical Logic Quarterly 17 (1):231-244.score: 50.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Brian H. Mayoh (1975). Review: Oliver Aberth, The Concept of Effective Method Applied to Computational Problems of Linear Algebra. [REVIEW] Journal of Symbolic Logic 40 (1):84-84.score: 50.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. Albert A. Mullin (1972). Review: N. V. Belakin, Computation of Effective Operators on Turing Machines with Restricted Erasure. [REVIEW] Journal of Symbolic Logic 37 (1):198-198.score: 50.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. Mariko Yasugi, Takakazu Mori & Yoshiki Tsujii (2007). The Effective Sequence of Uniformities and its Limit: As a Methodology in Computable Analysis. Annals of the Japan Association for Philosophy of Science 15 (2):99-121.score: 50.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Joseph Dreitlein (1993). The Unreasonable Effectiveness of Computer Physics. Foundations of Physics 23 (6):923-930.score: 48.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  
  40. 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: 48.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  
  41. 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: 46.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  
  42. Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2):133-148.score: 46.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  
  43. Jeremy Seligman (2002). The Scope of Turing's Analysis of Effective Procedures. Minds and Machines 12 (2):203-220.score: 44.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  
  44. Beth H. Jones & M. Tawfik Jelassi (1990). The Effect of Computer Intervention and Task Structure on Bargaining Outcome. Theory and Decision 28 (3):355-374.score: 44.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. Marc J. Natale (2002). The Effect of a Male-Oriented Computer Gaming Culture on Careers in the Computer Industry. Acm Sigcas Computers and Society 32 (2):24-31.score: 42.0
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  46. Eliichi Yamaguchi (1990). Effects of Computers on Japanese Schools. AI and Society 4 (2):147-154.score: 42.0
    In this paper I consider how the computer can or should be accepted in Japanese schools. The concept of “teaching” in Japan stresses learning from a long-term perspective. Whereas in the instructional technology, on which the CAI or the Tutoring System depends, step-by-step attainments in relatively short time are emphasized. The former is reluctant in using the computer, but both share the “Platonic” perspective which are goal-oriented. However, The “Socratic” teacher, who intends to activate students' innate disposition to be better, (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  47. Joyce Barakett & Lary Prochner (1987). The Effects of Computer Use in Early Childhood Socialization. Acm Sigcas Computers and Society 16 (4-1):19-27.score: 42.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  48. Sharon Derry (1994). Effects of Collaborative Interaction and Computer Tool Use. In Ashwin Ram & Kurt Eiselt (eds.), Proceedings of the Sixteenth Annual Conference of the Cognitive Science Society. Erlbaum. 16--248.score: 40.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  49. Takakazu Mori, Mariko Yasugi & Yoshiki Tsujii (2008). Effective Fine‐Convergence of Walsh‐Fourier Series. Mathematical Logic Quarterly 54 (5):519-534.score: 40.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  50. Birbaumer Niels (2008). Measure of Neurofeedback Effects in an fMRI Brain-Computer Interface with Support Vector Machine and Granger Causality Model. Frontiers in Human Neuroscience 2.score: 40.0
1 — 50 / 1000