35,871 research outputs found
Computational Nuclear Physics and Post Hartree-Fock Methods
We present a computational approach to infinite nuclear matter employing
Hartree-Fock theory, many-body perturbation theory and coupled cluster theory.
These lectures are closely linked with those of chapters 9, 10 and 11 and serve
as input for the correlation functions employed in Monte Carlo calculations in
chapter 9, the in-medium similarity renormalization group theory of dense
fermionic systems of chapter 10 and the Green's function approach in chapter
11. We provide extensive code examples and benchmark calculations, allowing
thereby an eventual reader to start writing her/his own codes. We start with an
object-oriented serial code and end with discussions on strategies for porting
the code to present and planned high-performance computing facilities.Comment: 82 pages, to appear in Lecture Notes in Physics (Springer), "An
advanced course in computational nuclear physics: Bridging the scales from
quarks to neutron stars", M. Hjorth-Jensen, M. P. Lombardo, U. van Kolck,
Editor
Towards Understanding the Origin of Genetic Languages
Molecular biology is a nanotechnology that works--it has worked for billions
of years and in an amazing variety of circumstances. At its core is a system
for acquiring, processing and communicating information that is universal, from
viruses and bacteria to human beings. Advances in genetics and experience in
designing computers have taken us to a stage where we can understand the
optimisation principles at the root of this system, from the availability of
basic building blocks to the execution of tasks. The languages of DNA and
proteins are argued to be the optimal solutions to the information processing
tasks they carry out. The analysis also suggests simpler predecessors to these
languages, and provides fascinating clues about their origin. Obviously, a
comprehensive unraveling of the puzzle of life would have a lot to say about
what we may design or convert ourselves into.Comment: (v1) 33 pages, contributed chapter to "Quantum Aspects of Life",
edited by D. Abbott, P. Davies and A. Pati, (v2) published version with some
editin
Why Philosophers Should Care About Computational Complexity
One might think that, once we know something is computable, how efficiently
it can be computed is a practical question with little further philosophical
importance. In this essay, I offer a detailed case that one would be wrong. In
particular, I argue that computational complexity theory---the field that
studies the resources (such as time, space, and randomness) needed to solve
computational problems---leads to new perspectives on the nature of
mathematical knowledge, the strong AI debate, computationalism, the problem of
logical omniscience, Hume's problem of induction, Goodman's grue riddle, the
foundations of quantum mechanics, economic rationality, closed timelike curves,
and several other topics of philosophical interest. I end by discussing aspects
of complexity theory itself that could benefit from philosophical analysis.Comment: 58 pages, to appear in "Computability: G\"odel, Turing, Church, and
beyond," MIT Press, 2012. Some minor clarifications and corrections; new
references adde
The integrated theory of emotional behavior follows a radically goal-directed approach
status: publishe
- âŠ