Results for 'Siam J. Comput'

1000+ found
Order:
  1.  97
    Randomness and Recursive Enumerability.Siam J. Comput - unknown
    One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  27
    Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM journal on computing, vol. 18 , pp. 186–208. - Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that release minimum knowledge. Mathematical foundations of computer science 1986, Proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25–29, 1986, edited by J. Gruska, B. Rovan, and J. Wiedermann, Lecture notes in computer science, vol. 233, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1986, pp. 639–650. - Oded Goldreich. Randomness, interactive proofs, and zero-knowledge—a survey. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988, pp. 377–405. [REVIEW]Lance Fortnow - 1991 - Journal of Symbolic Logic 56 (3):1092-1094.
  3. WEIZENBAUM, J., "Computer Power and Human Reason". [REVIEW]Alan Reeves - 1979 - Australasian Journal of Philosophy 57:106.
    No categories
     
    Export citation  
     
    Bookmark  
  4. YAKOWITZ S. J. Computational Probability and Simulation. [REVIEW]B. de Finetti - 1977 - Scientia 71 (12):837.
    No categories
     
    Export citation  
     
    Bookmark  
  5. Yakowitz S. J. Computational Probability And Simulation. [REVIEW]B. de Finetti - 1977 - Scientia 71 (112):837.
    No categories
     
    Export citation  
     
    Bookmark  
  6.  61
    J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, an. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  6
    Michael J. Beeson. Computerizing mathematics: logic and computation. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 191–225. [REVIEW]J. C. Shepherdson - 1991 - Journal of Symbolic Logic 56 (3):1090-1091.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  13
    The Computer Comes of Age: The People, the Hardware, and the Software by Rene Moreau; J. Howlett; Engines of the Mind: A History of the Computer by Joel Shurkin.J. Bolter - 1985 - Isis 76:113-115.
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  37
    McCarthy J.. Towards a mathematical science of computation. Information processing 1962, Proceedings oflFIP Congress 62, organized by the International Federation for Information Processing, Munich, 27 August-1 September 1962, edited by Popplewell Cicely M., North-Holland Publishing Company, Amsterdam 1963, pp. 21–28.McCarthy John. Problems in the theory of computation. Information processing 1965, Proceedings of IFIP Congress 65, organized by the International Federation for Information Processing, New York City, May 24–29, 1965, Volume I, edited by Kalenich Wayne A., Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, pp. 219–222. [REVIEW]Richard J. Orgass - 1971 - Journal of Symbolic Logic 36 (2):346-347.
  10.  8
    Review: J. McCarthy, Cicely M. Popplewell, Towards a Mathematical Science of Computation; John McCarthy, Wayne A. Kalenich, Problems in the Theory of Computation. [REVIEW]Richard J. Orgass - 1971 - Journal of Symbolic Logic 36 (2):346-347.
  11.  7
    Postley J. A.. A method for the evaluation of a system of Boolean algebraic equations. Mathematical tables and other aids to computation, vol. 9 , pp. 5–8. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (3):335-335.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  4
    Ash C. J. and Knight J.. Computable structures and the hyperarithmetical hierarchy. Studies in logic and the foundations of mathematics, vol. 144. Elsevier, Amsterdam etc. 2000, xv + 346 pp. [REVIEW]Valentina Harizanov - 2001 - Bulletin of Symbolic Logic 7 (3):383-385.
  13.  14
    Computable Structures and the Hyperarithmetical Hierarchy.C. J. Ash - 2000 - Elsevier.
    This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   46 citations  
  14.  14
    Murray F. J.. Mechanisms, and robots. Journal of the Association for Computing Machinery, vol. 2 , pp. 61–82.Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (3):334-335.
  15.  8
    Stearns R. E., Hartmanis J., and Lewis P. M. II. Hierarchies of memory limited computations. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 179–190. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):624-625.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  16.  6
    Review: R. E. Stearns, J. Hartmanis, P. M. Lewis, Hierarchies of Memory Limited Computations. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):624-625.
  17. Do computer simulations support the Argument from Disagreement?Aron Vallinder & Erik J. Olsson - 2013 - Synthese 190 (8):1437-1454.
    According to the Argument from Disagreement (AD) widespread and persistent disagreement on ethical issues indicates that our moral opinions are not influenced by moral facts, either because there are no such facts or because there are such facts but they fail to influence our moral opinions. In an innovative paper, Gustafsson and Peterson (Synthese, published online 16 October, 2010) study the argument by means of computer simulation of opinion dynamics, relying on the well-known model of Hegselmann and Krause (J Artif (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  18.  50
    Computer Simulations, Machine Learning and the Laplacean Demon: Opacity in the Case of High Energy Physics.Florian J. Boge & Paul Grünke - forthcoming - In Andreas Kaminski, Michael Resch & Petra Gehring (eds.), The Science and Art of Simulation II.
    In this paper, we pursue three general aims: (I) We will define a notion of fundamental opacity and ask whether it can be found in High Energy Physics (HEP), given the involvement of machine learning (ML) and computer simulations (CS) therein. (II) We identify two kinds of non-fundamental, contingent opacity associated with CS and ML in HEP respectively, and ask whether, and if so how, they may be overcome. (III) We address the question of whether any kind of opacity, contingent (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  9
    Dubucs, J., & Bourdeau, M. . Constructivity and Computability in Historical and Philosophical Perspective . Springer Netherlands, XI. 214, pp. ISBN: 978-94-017-9216-5 978-94-017-9217-2. [REVIEW]Bruno Da Ré - 2015 - Revista de Humanidades de Valparaíso 6:125-131.
    Book Review: Dubucs, J., & Bourdeau, M.. Constructivity and Computability in Historical and Philosophical Perspective. Springer Netherlands, XI. 214, pp. ISBN: 978-94-017-9216-5 978-94-017-9217-2, €83.29.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  60
    The developmental programme - concept or muddle?Programmes for Development, Genes, Chromosomes and Computer Models in Developmental Biology. Edited by Alma Swan, HERBERT Macgregor and Robert Ransom.J. Embryol. Exp. Morph. Volume 83 Supplement. The Company of Biologists Ltd, Cambridge, 1984. Pp. 369. �12.00, $23.00. [REVIEW]J. Robert & S. Whittle - 1986 - Bioessays 5 (2):91-92.
  21.  97
    Computer knows best? The need for value-flexibility in medical AI.Rosalind J. McDougall - 2019 - Journal of Medical Ethics 45 (3):156-160.
    Artificial intelligence is increasingly being developed for use in medicine, including for diagnosis and in treatment decision making. The use of AI in medical treatment raises many ethical issues that are yet to be explored in depth by bioethicists. In this paper, I focus specifically on the relationship between the ethical ideal of shared decision making and AI systems that generate treatment recommendations, using the example of IBM’s Watson for Oncology. I argue that use of this type of system creates (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  22.  31
    The computational philosophy: simulation as a core philosophical method.Conor Mayo-Wilson & Kevin J. S. Zollman - 2021 - Synthese 199 (1-2):3647-3673.
    Modeling and computer simulations, we claim, should be considered core philosophical methods. More precisely, we will defend two theses. First, philosophers should use simulations for many of the same reasons we currently use thought experiments. In fact, simulations are superior to thought experiments in achieving some philosophical goals. Second, devising and coding computational models instill good philosophical habits of mind. Throughout the paper, we respond to the often implicit objection that computer modeling is “not philosophical.”.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23. Design of Arithmetic Units for Digital Computers.J. B. Gosling - 1980
  24.  9
    Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
    For countable structure, "Scott rank" provides a measure of internal, model-theoretic complexity. For a computable structure, the Scott rank is at most [Formula: see text]. There are familiar examples of computable structures of various computable ranks, and there is an old example of rank [Formula: see text]. In the present paper, we show that there is a computable structure of Scott rank [Formula: see text]. We give two different constructions. The first starts with an arithmetical example due to Makkai, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  25.  29
    Computability of Recursive Functions.J. C. Shepherdson & H. E. Sturgis - 1967 - Journal of Symbolic Logic 32 (1):122-123.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  26.  72
    Why computer simulations are not inferences, and in what sense they are experiments.Florian J. Boge - 2018 - European Journal for Philosophy of Science 9 (1):1-30.
    AbstractThe question of where, between theory and experiment, computer simulations (CSs) locate on the methodological map is one of the central questions in the epistemology of simulation (cf. Saam Journal for General Philosophy of Science, 48, 293–309, 2017). The two extremes on the map have them either be a kind of experiment in their own right (e.g. Barberousse et al. Synthese, 169, 557–574, 2009; Morgan 2002, 2003, Journal of Economic Methodology, 12(2), 317–329, 2005; Morrison Philosophical Studies, 143, 33–57, 2009; Morrison (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  27.  2
    Computable structures of rank omega (ck)(1).J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
    For countable structure, "Scott rank" provides a measure of internal, model-theoretic complexity. For a computable structure, the Scott rank is at most [Formula: see text]. There are familiar examples of computable structures of various computable ranks, and there is an old example of rank [Formula: see text]. In the present paper, we show that there is a computable structure of Scott rank [Formula: see text]. We give two different constructions. The first starts with an arithmetical example due to Makkai, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28. Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  31
    Brain–Computer Interfaces: Lessons to Be Learned from the Ethics of Algorithms.Andreas Wolkenstein, Ralf J. Jox & Orsolya Friedrich - 2018 - Cambridge Quarterly of Healthcare Ethics 27 (4):635-646.
    :Brain–computer interfaces are driven essentially by algorithms; however, the ethical role of such algorithms has so far been neglected in the ethical assessment of BCIs. The goal of this article is therefore twofold: First, it aims to offer insights into whether the problems related to the ethics of BCIs can be better grasped with the help of already existing work on the ethics of algorithms. As a second goal, the article explores what kinds of solutions are available in that body (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30. Subsymbolic computation and the chinese room.David J. Chalmers - 1992 - In J. Dinsmore (ed.), The Symbolic and Connectionist Paradigms: Closing the Gap. Lawrence Erlbaum. pp. 25--48.
    More than a decade ago, philosopher John Searle started a long-running controversy with his paper “Minds, Brains, and Programs” (Searle, 1980a), an attack on the ambitious claims of artificial intelligence (AI). With his now famous _Chinese Room_ argument, Searle claimed to show that despite the best efforts of AI researchers, a computer could never recreate such vital properties of human mentality as intentionality, subjectivity, and understanding. The AI research program is based on the underlying assumption that all important aspects of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  31.  69
    Computer ethics: mapping the foundationalist debate.Luciano Floridi & J. W. Sanders - 2002 - Ethics and Information Technology 4 (1):1–9.
    The paper provides a critical review of thedebate on the foundations of Computer Ethics. Starting from a discussion of Moor'sclassic interpretation of the need for CEcaused by a policy and conceptual vacuum, fivepositions in the literature are identified anddiscussed: the ``no resolution approach'',according to which CE can have no foundation;the professional approach, according to whichCE is solely a professional ethics; the radicalapproach, according to which CE deals withabsolutely unique issues, in need of a uniqueapproach; the conservative approach, accordingto which CE (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  32.  2
    Computer Simulation Validation: Fundamental Concepts, Methodological Frameworks, and Philosophical Perspectives.Claus Beisbart & Nicole J. Saam (eds.) - 2019 - Springer Verlag.
    This unique volume introduces and discusses the methods of validating computer simulations in scientific research. The core concepts, strategies, and techniques of validation are explained by an international team of pre-eminent authorities, drawing on expertise from various fields ranging from engineering and the physical sciences to the social sciences and history. The work also offers new and original philosophical perspectives on the validation of simulations. Topics and features: introduces the fundamental concepts and principles related to the validation of computer simulations, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. Computational Logic Essays in Honor of Alan Robinson.Jean-Louis Lassez, G. Plotkin & J. A. Robinson - 1991
     
    Export citation  
     
    Bookmark  
  34. On implementing a computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
    To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The implementation relation is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   56 citations  
  35.  98
    Is having your computer compromised a personal assault? The ethics of extended cognition.J. Adam Carter & S. Orestis Palermos - 2016 - Journal of the American Philosophical Association 2 (4):542-560.
    Philosophy of mind and cognitive science have recently become increasingly receptive to the hypothesis of extended cognition, according to which external artifacts such as our laptops and smartphones can—under appropriate circumstances—feature as material realizers of a person's cognitive processes. We argue that, to the extent that the hypothesis of extended cognition is correct, our legal and ethical theorizing and practice must be updated by broadening our conception of personal assault so as to include intentional harm toward gadgets that have been (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  36.  71
    Gregory J. E. Rawlins, moths to the flame: The seductions of computer technology. [REVIEW]Brian Harvey - 1999 - Minds and Machines 9 (2):267-270.
  37.  13
    Computable explanations.J. V. Howard - 1975 - Mathematical Logic Quarterly 21 (1):215-224.
  38.  13
    Computers, Science, and Society. [REVIEW]M. V. J. - 1972 - Review of Metaphysics 25 (3):554-555.
    F. H. George is Professor of Cybernetics at Brunel University in England. His book comprises eight chapters originally developed as lectures for a non-specialist audience. He points out the position of computer science among the sciences, explains its aims, procedures, and achievements to date, and speculates on its long-term implications for science in particular and society in general. Among the topics discussed are biological simulation and organ replacement, automated education, and the new philosophy of science. Each chapter concludes with a (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39. Computational models of emotion. Marsella, S., Gratch, J., Petta & P. - 2010 - In Klaus R. Scherer, Tanja Bänziger & Etienne Roesch (eds.), A Blueprint for Affective Computing: A Sourcebook and Manual. Oxford University Press.
  40. Philosophy of Computer Science: An Introductory Course.William J. Rapaport - 2005 - Teaching Philosophy 28 (4):319-341.
    There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  41.  12
    The Computer Simulation of Behavior. [REVIEW]F. J. - 1972 - Review of Metaphysics 26 (1):149-150.
    Professor Apter has written a valuable book. His work, a non-technical introduction to the most important aspect of the use of computers in psychology, is simple, readable, yet surprisingly concentrated and provocative. His first two chapters contain an unusually clear, concise examination of the extent to which minds and machines can be compared. Although brief it successfully collates the work of famous scientists and scholars of varied disciplines into a coherent cybernetic theory. Chapter three is a simplified explanation of the (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  42. Computational psychiatry.P. Read Montague, Raymond J. Dolan, Karl J. Friston & Peter Dayan - 2012 - Trends in Cognitive Sciences 16 (1):72-80.
  43.  15
    Computer-Assisted Decision Making in Medicine.J. C. Kunz, E. H. Shortliffe, B. G. Buchanan & E. A. Feigenbaum - 1984 - Journal of Medicine and Philosophy 9 (2):135-160.
    This article reviews the strengths and limitations of five major paradigms of medical computer-assisted decision making (CADM): (1) clinical algorithms, (2) statistical analysis of collections of patient data, (3) mathematical models of physical processes, (4) decision analysis, and (5) symbolic reasoning or artificial intelligence (Al). No one technique is best for all applications, and there is recent promising work which combines two or more established techniques. We emphasize both the inherent power of symbolic reasoning and the promise of artificial intelligence (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44.  33
    Gregory J. E. Rawlins, slaves of the machine: The quickening of computer technology. [REVIEW]Stacey L. Edgar - 2000 - Minds and Machines 10 (3):444-448.
  45. Computational Complexity and Godel's Incompleteness Theorem.Gregory J. Chaitin - 1970 - [Rio De Janeiro, Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
  46.  41
    Computer Simulation Validation - Fundamental Concepts, Methodological Frameworks, and Philosophical Perspectives.Claus Beisbart & Nicole J. Saam - 2019 - Springer.
    This unique volume introduces and discusses the methods of validating computer simulations in scientific research. The core concepts, strategies, and techniques of validation are explained by an international team of pre-eminent authorities, drawing on expertise from various fields ranging from engineering and the physical sciences to the social sciences and history. The work also offers new and original philosophical perspectives on the validation of simulations. Topics and features: introduces the fundamental concepts and principles related to the validation of computer simulations, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  14
    On computer science, visual science, and the physiological utility of models.Barry J. Richmond & Michael E. Goldberg - 1985 - Behavioral and Brain Sciences 8 (2):300-301.
  48.  49
    Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  11
    Computational complexity for bounded distributive lattices with negation.Dmitry Shkatov & C. J. Van Alten - 2021 - Annals of Pure and Applied Logic 172 (7):102962.
    We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  3
    Five Ways in Which Computational Modeling Can Help Advance Cognitive Science: Lessons From Artificial Grammar Learning.Willem Zuidema, Robert M. French, Raquel G. Alhama, Kevin Ellis, Timothy J. O'Donnell, Tim Sainburg & Timothy Q. Gentner - 2020 - Topics in Cognitive Science 12 (3):925-941.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000