Journal Article10.2307/2371045
An Unsolvable Problem of Elementary Number Theory
1.8K
TL;DR: The JSTOR Archive is a trusted digital repository providing for long-term preservation and access to leading academic journals and scholarly literature from around the world as mentioned in this paper, which is supported by libraries, scholarly societies, publishers, and foundations.
read more
Abstract: Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. The JSTOR Archive is a trusted digital repository providing for long-term preservation and access to leading academic journals and scholarly literature from around the world. The Archive is supported by libraries, scholarly societies, publishers, and foundations. It is an initiative of JSTOR, a not-for-profit organization with a mission to help the scholarly community take advantage of advances in technology. For more information regarding JSTOR, please contact support@jstor.org.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The notion of computation is fundamental to an autonomous neuroscience
TL;DR: This commentary will show how the notion of computation in neuroscience differs from that of other fields that investigate complex systems and argue that computation at various levels of neural organization is the paramount goal of neuroscientific explanation.
6
Husserl on the ‘Totality of all conceivable arithmetical operations’
TL;DR: In this article, the authors discuss Husserl's deep account of the notions of "calculation" and "arithmetical operation" which is found in the final chapter of the Philosophy of Arithmetic, and demonstrate that the class of operations that they have in mind turns out to be extensionally equivalent to the one that, in contemporary logic, is known as "partial recursive functions".
6
The Undecidability of λK-Conversion
Haskell B. Curry
- 01 Jan 1969
TL;DR: In this article, a new proof of an analogous result for λK-conversion was given, which was obtained in the course of preparing the second volume of [5].
6
Quantum computing with electron spins in quantum dots
Robert Andrzej Zak,Beat Röthlisberger,Stefano Chesi,Daniel Loss +3 more
- 01 Jul 2010
TL;DR: In this article, the authors provide an introduction to the standard model of quantum computing and the basic criteria for its realization, and discuss the problem of decoherence in this system with particular emphasis on its theoretical treatment and possible ways to overcome it.
6
The New Computationalism – A Lesson from Embodied Agents
Jozef Kelemen,Alica Kelemenová +1 more
- 01 Jan 2009
TL;DR: The contribution sketches this new situation, and provides an example of a theoretical model rooted in the traditional computationalism which reflects some new requirements.
6