Search results for 'Church-Turing thesis' (try it on Scholar)

1000+ found
Sort by:
  1. Alan Mathison Turing (2012). Alan Turing's Systems of Logic: The Princeton Thesis. Princeton University Press.score: 1260.0
     
    My bibliography  
     
    Export citation  
  2. Saul A. Kripke (2013). The Church-TuringThesis’ as a Special Corollary of Gödel’s Completeness Theorem. In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Turing, Gödel, Church, and Beyond. MIT Press.score: 756.0
    Traditionally, many writers, following Kleene (1952), thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing’s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis, what Turing (1936) calls “argument I,” has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Mark Sprevak (2008). Kripke's Paradox and the Church-Turing Thesis. Synthese 160 (2):285-295.score: 720.0
    Kripke (1982, Wittgenstein on rules and private language. Cambridge, MA: MIT Press) presents a rule-following paradox in terms of what we meant by our past use of “plus”, but the same paradox can be applied to any other term in natural language. Many responses to the paradox concentrate on fixing determinate meaning for “plus”, or for a small class of other natural language terms. This raises a problem: how can these particular responses be generalised to the whole of natural language? (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Oron Shagrir & Itamar Pitowsky (2003). Physical Hypercomputation and the Church–Turing Thesis. Minds and Machines 13 (1):87-101.score: 720.0
    We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is physical in the sense that it is compatible with General Relativity. We discuss some objections, focusing on those which deny that the device is either a computer or computes a function that is not Turing computable. Finally, we argue that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's (...)
    Direct download (18 more)  
     
    My bibliography  
     
    Export citation  
  5. Dina Goldin & Peter Wegner (2008). The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis. [REVIEW] Minds and Machines 18 (1):17-38.score: 720.0
    The classical view of computing positions computation as a closed-box transformation of inputs (rational numbers or finite strings) to outputs. According to the interactive view of computing, computation is an ongoing interactive process rather than a function-based transformation of an input to an output. Specifically, communication with the outside world happens during the computation, not before or after it. This approach radically changes our understanding of what is computation and how it is modeled. The acceptance of interaction as a new (...)
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  6. Itamar Pitowsky (2003). Physical Hypercomputation and the Church–Turing Thesis. Minds and Machines 13 (1):87-101.score: 720.0
    We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is physical in the sense that it is compatible with General Relativity. We discuss some objections, focusing on those which deny that the device is either a computer or computes a function that is not Turing computable. Finally, we argue that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy’s (...)
    No categories
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  7. Carol E. Cleland (1993). Is the Church-Turing Thesis True? Minds and Machines 3 (3):283-312.score: 714.0
    The Church-Turing thesis makes a bold claim about the theoretical limits to computation. It is based upon independent analyses of the general notion of an effective procedure proposed by Alan Turing and Alonzo Church in the 1930''s. As originally construed, the thesis applied only to the number theoretic functions; it amounted to the claim that there were no number theoretic functions which couldn''t be computed by a Turing machine but could be computed by means of some other (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Leon Horsten (1995). The Church-Turing Thesis and Effective Mundane Procedures. Minds and Machines 5 (1):1-8.score: 558.0
    We critically discuss Cleland''s analysis of effective procedures as mundane effective procedures. She argues that Turing machines cannot carry out mundane procedures, since Turing machines are abstract entities and therefore cannot generate the causal processes that are generated by mundane procedures. We argue that if Turing machines cannot enter the physical world, then it is hard to see how Cleland''s mundane procedures can enter the world of numbers. Hence her arguments against versions of the Church-Turing thesis for number (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Tim Button (2009). SAD Computers and Two Versions of the Church–Turing Thesis. British Journal for the Philosophy of Science 60 (4):765-792.score: 540.0
    Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  10. Gualtiero Piccinini (2011). The Physical Church–Turing Thesis: Modest or Bold? British Journal for the Philosophy of Science 62 (4):733 - 769.score: 540.0
    This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  11. Paolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.score: 540.0
    A version of the Church-Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical, more than a logico-mathematical, proposition. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal computation. These models depend on infinite computation, explicitly or implicitly, and appear physically implausible; moreover, even if infinite computation were realizable, the Halting Problem would not (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  12. B. Jack Copeland (2008). The Church-Turing Thesis. In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.score: 540.0
    There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. The Church-Turing thesis is often misunderstood, particularly in recent writing in the philosophy of mind.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  13. Gualtiero Piccinini (2007). Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy. Synthese 154 (1):97-120.score: 540.0
    The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such arguments in light of recent work on CTT and argue that they are unsound. Although CTT does nothing to support computationalism, it is not irrelevant to it. By eliminating misunderstandings about the relationship between CTT and computationalism, we deepen our appreciation of computationalism as an empirical hypothesis.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. R. Urbaniak (2011). How Not To Use the Church-Turing Thesis Against Platonism. Philosophia Mathematica 19 (1):74-89.score: 540.0
    Olszewski claims that the Church-Turing thesis can be used in an argument against platonism in philosophy of mathematics. The key step of his argument employs an example of a supposedly effectively computable but not Turing-computable function. I argue that the process he describes is not an effective computation, and that the argument relies on the illegitimate conflation of effective computability with there being a way to find out . ‘Ah, but,’ you say, ‘what’s the use of its being (...)
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  15. Selmer Bringsjord, In Defense of the Unprovability of the Church-Turing Thesis.score: 540.0
    One of us has previously argued that the Church-Turing Thesis (CTT), contra Elliot Mendelson, is not provable, and is — light of the mind’s capacity for effortless hypercomputation — moreover false (e.g., [13]). But a new, more serious challenge has appeared on the scene: an attempt by Smith [28] to prove CTT. His case is a clever “squeezing argument” that makes crucial use of Kolmogorov-Uspenskii (KU) machines. The plan for the present paper is as follows. After covering some (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  16. Wilfried Sieg, Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science.score: 540.0
    Wilfried Sieg. Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Enrique Alonso (1999). Ingenio E Industria. Guía de Referencia Sobre la Tesis de Turing-Church (Inventiveness and Skili. Reference Guide on Church-Turing Thesis). Theoria 14 (2):249-273.score: 540.0
    La Teoría de la Computación es un campo especialmente rico para la indagación filosófica. EI debate sobre el mecanicismo y la discusión en torno a los fundamentos de la matemática son tópicos que estan directamente asociados a la Teoria de la Computación desde su misma creación como disciplina independiente. La Tesis de Turing-Church constituye uno de los resultados mas característicos en este campo estando, además, lleno de consecuencias filosóficas. En este ensayo se ofrece una guía de referencia útil a aquellos (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Selmer Bringsjord & Konstantine Arkoudas (2006). On the Provability, Veracity, and AI-Relevance of the Church-Turing Thesis. In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag. 68-118.score: 492.0
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  19. Carol Cleland (2006). The Church-Turing Thesis: A Last Vestige of a Failed Mathematical Program. In A. Olszewski, J. Wole'nski & R. Janusz (eds.), Church's Thesis After Seventy Years. Ontos Verlag. 119-146.score: 492.0
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  20. Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.score: 471.0
    Church's thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing's work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church's thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing's work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  21. 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: 471.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  
  22. Antony Galton (1996). The Church-Turing Thesis: Its Nature and Status. In P. J. R. Millican & A. Clark (eds.), Machines and Thought: The Legacy of Alan Turing, Volume 1. Clarendon Press.score: 459.0
    No categories
     
    My bibliography  
     
    Export citation  
  23. D. Goldin & P. Wegner (2008). Refuting the Strong Church-Turing Thesis: The Interactive Nature of Computing. Minds and Machines 18 (1):17-38.score: 450.0
  24. O. Shagrir & I. Pitowsky (forthcoming). The Church-Turing Thesis and Hyper-Computation. Minds and Machines.score: 450.0
  25. Bhupinder Singh & V. I. I. Gödel’S. Theorem (2006). And the Church-Turing Thesis. Studia Logica 82 (1.03 pt).score: 450.0
    No categories
     
    My bibliography  
     
    Export citation  
  26. S. G. Shanker (1987). Wittgenstein Versus Turing on the Nature of Church's Thesis. Notre Dame Journal of Formal Logic 28 (4):615-649.score: 435.0
  27. Luca Anderlini (1990). Some Notes on Church's Thesis and the Theory of Games. Theory and Decision 29 (1):19-52.score: 384.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. David Israel (2002). Reflections on Gödel's and Gandy's Reflections on Turing's Thesis. Minds and Machines 12 (2):181-201.score: 369.0
    We sketch the historical and conceptual context of Turing's analysis of algorithmic or mechanical computation. We then discuss two responses to that analysis, by Gödel and by Gandy, both of which raise, though in very different ways. The possibility of computation procedures that cannot be reduced to the basic procedures into which Turing decomposed computation. Along the way, we touch on some of Cleland's views.
    Direct download (16 more)  
     
    My bibliography  
     
    Export citation  
  29. M. H. A. Newman & A. M. Turing (1942). A Formal Theorem in Church's Theory of Types. Journal of Symbolic Logic 7 (1):28-33.score: 360.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  30. A. M. Turing (1942). The Use of Dots as Brackets in Church's System. Journal of Symbolic Logic 7 (4):146-156.score: 360.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  31. Alonzo Church (1937). Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem. [REVIEW] Journal of Symbolic Logic 2 (1):42-43.score: 360.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Darren Abramson (2011). Philosophy of Mind Is (in Part) Philosophy of Computer Science. Minds and Machines 21 (2):203-219.score: 270.0
    In this paper I argue that whether or not a computer can be built that passes the Turing test is a central question in the philosophy of mind. Then I show that the possibility of building such a computer depends on open questions in the philosophy of computer science: the physical Church-Turing thesis and the extended Church-Turing thesis. I use the link between the issues identified in philosophy of mind and philosophy of computer science to respond (...)
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  33. Vincent C. Müller (2011). On the Possibilities of Hypercomputing Supertasks. Minds and Machines 21 (1):83-96.score: 270.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 they (...)
    Direct download (13 more)  
     
    My bibliography  
     
    Export citation  
  34. Oron Shagrir (2002). Effective Computation by Humans and Machines. Minds and Machines 12 (2):221-240.score: 270.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 convincing (...)
    Direct download (18 more)  
     
    My bibliography  
     
    Export citation  
  35. Benjamin Wells (2002). Is There a Nonrecursive Decidable Equational Theory? Minds and Machines 12 (2):301-324.score: 270.0
    The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of variables, (...)
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  36. Hermann G. W. Burchard (2005). Symbolic Languages and Natural Structures a Mathematician's Account of Empiricism. Foundations of Science 10 (2):153-245.score: 270.0
    The ancient dualism of a sensible and an intelligible world important in Neoplatonic and medieval philosophy, down to Descartes and Kant, would seem to be supplanted today by a scientific view of mind-in-nature. Here, we revive the old dualism in a modified form, and describe mind as a symbolic language, founded in linguistic recursive computation according to the Church-Turing thesis, constituting a world L that serves the human organism as a map of the Universe U. This methodological distinction (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  37. B. Jack Copeland & Diane Proudfoot (2000). What Turing Did After He Invented the Universal Turing Machine. Journal of Logic, Language and Information 9 (4):491-509.score: 267.0
    Alan Turing anticipated many areas of current research incomputer and cognitive science. This article outlines his contributionsto Artificial Intelligence, connectionism, hypercomputation, andArtificial Life, and also describes Turing's pioneering role in thedevelopment of electronic stored-program digital computers. It locatesthe origins of Artificial Intelligence in postwar Britain. It examinesthe intellectual connections between the work of Turing and ofWittgenstein in respect of their views on cognition, on machineintelligence, and on the relation between provability and truth. Wecriticise widespread and influential misunderstandings of theChurch–Turing (...) and of the halting theorem. We also explore theidea of hypercomputation, outlining a number of notional machines thatcompute the uncomputable. (shrink)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  38. B. Jack Copeland & Oron Shagrir (2007). Physical Computation: How General Are Gandy's Principles for Mechanisms? [REVIEW] Minds and Machines 17 (2):217-231.score: 261.0
    What are the limits of physical computation? In his ‘Church’s Thesis and Principles for Mechanisms’, Turing’s student Robin Gandy proved that any machine satisfying four idealised physical ‘principles’ is equivalent to some Turing machine. Gandy’s four principles in effect define a class of computing machines (‘Gandy machines’). Our question is: What is the relationship of this class to the class of all (ideal) physical computing machines? Gandy himself suggests that the relationship is identity. We do not share this view. (...)
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  39. Gualtiero Piccinini (2003). Alan Turing and the Mathematical Objection. Minds and Machines 13 (1):23-48.score: 234.0
    This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...)
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  40. B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.score: 234.0
    Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...)
    Direct download (17 more)  
     
    My bibliography  
     
    Export citation  
  41. Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW] Minds and Machines 18 (3):349-355.score: 225.0
  42. Alonzo Church, C. Anthony Anderson & Michael Zelëny (eds.) (2001). Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Kluwer Academic Publishers.score: 210.0
    This volume began as a remembrance of Alonzo Church while he was still with us and is now finally complete. It contains papers by many well-known scholars, most of whom have been directly influenced by Church's own work. Often the emphasis is on foundational issues in logic, mathematics, computation, and philosophy - as was the case with Church's contributions, now universally recognized as having been of profound fundamental significance in those areas. The volume will be of interest to logicians, computer (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  43. Michael Deutsch (1994). A Note on the Theorems of Church‐Turing and Trachtenbrot. Mathematical Logic Quarterly 40 (3):422-424.score: 196.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  44. Mike Stannett (2003). Computation and Hypercomputation. Minds and Machines 13 (1):115-153.score: 189.0
    Does Nature permit the implementation of behaviours that cannot be simulated computationally? We consider the meaning of physical computation in some detail, and present arguments in favour of physical hypercomputation: for example, modern scientific method does not allow the specification of any experiment capable of refuting hypercomputation. We consider the implications of relativistic algorithms capable of solving the (Turing) Halting Problem. We also reject as a fallacy the argument that hypercomputation has no relevance because non-computable values are indistinguishable from sufficiently (...)
    Direct download (14 more)  
     
    My bibliography  
     
    Export citation  
  45. Aran Nayebi (2014). Practical Intractability: A Critique of the Hypercomputation Movement. [REVIEW] Minds and Machines 24 (3):275-305.score: 189.0
    For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Amit Hagar (2007). Quantum Algorithms: Philosophical Lessons. [REVIEW] Minds and Machines 17 (2):233-247.score: 180.0
  47. Tim Button (2009). Hyperloops Do Not Threaten the Notion of an Effective Procedure. Lecture Notes in Computer Science 5635:68-78.score: 180.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  
  48. I. Alonzo Church (1965). Extensions of Some Theorems of Godel and Church. In Martin Davis (ed.), The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication. 230.score: 180.0
    No categories
     
    My bibliography  
     
    Export citation  
  49. Alonzo Church (1972). Review: Octavian C. Basca, La Synthese des Automates Finis Par la Methode de A. Church. [REVIEW] Journal of Symbolic Logic 37 (3):625-626.score: 180.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  50. Amit Hagar, Ed Fredkin and the Physics of Information - An Inside Story of an Outsider Scientist.score: 180.0
    This article tells the story of Ed Fredkin, a pilot, programmer, engineer, hardware designer and entrepreneur, whose work inside and outside academia has influenced major developments in computer science and in the foundations of theoretical physics for the past fifty years.
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000