2,292 research outputs found
Design for a Darwinian Brain: Part 1. Philosophy and Neuroscience
Physical symbol systems are needed for open-ended cognition. A good way to
understand physical symbol systems is by comparison of thought to chemistry.
Both have systematicity, productivity and compositionality. The state of the
art in cognitive architectures for open-ended cognition is critically assessed.
I conclude that a cognitive architecture that evolves symbol structures in the
brain is a promising candidate to explain open-ended cognition. Part 2 of the
paper presents such a cognitive architecture.Comment: Darwinian Neurodynamics. Submitted as a two part paper to Living
Machines 2013 Natural History Museum, Londo
A graph-based mathematical morphology reader
This survey paper aims at providing a "literary" anthology of mathematical
morphology on graphs. It describes in the English language many ideas stemming
from a large number of different papers, hence providing a unified view of an
active and diverse field of research
Exploring the landscapes of "computing": digital, neuromorphic, unconventional -- and beyond
The acceleration race of digital computing technologies seems to be steering
toward impasses -- technological, economical and environmental -- a condition
that has spurred research efforts in alternative, "neuromorphic" (brain-like)
computing technologies. Furthermore, since decades the idea of exploiting
nonlinear physical phenomena "directly" for non-digital computing has been
explored under names like "unconventional computing", "natural computing",
"physical computing", or "in-materio computing". This has been taking place in
niches which are small compared to other sectors of computer science. In this
paper I stake out the grounds of how a general concept of "computing" can be
developed which comprises digital, neuromorphic, unconventional and possible
future "computing" paradigms. The main contribution of this paper is a
wide-scope survey of existing formal conceptualizations of "computing". The
survey inspects approaches rooted in three different kinds of background
mathematics: discrete-symbolic formalisms, probabilistic modeling, and
dynamical-systems oriented views. It turns out that different choices of
background mathematics lead to decisively different understandings of what
"computing" is. Across all of this diversity, a unifying coordinate system for
theorizing about "computing" can be distilled. Within these coordinates I
locate anchor points for a foundational formal theory of a future
computing-engineering discipline that includes, but will reach beyond, digital
and neuromorphic computing.Comment: An extended and carefully revised version of this manuscript has now
(March 2021) been published as "Toward a generalized theory comprising
digital, neuromorphic, and unconventional computing" in the new open-access
journal Neuromorphic Computing and Engineerin
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
We describe an extension of Earley's parser for stochastic context-free
grammars that computes the following quantities given a stochastic context-free
grammar and an input string: a) probabilities of successive prefixes being
generated by the grammar; b) probabilities of substrings being generated by the
nonterminals, including the entire string being generated by the grammar; c)
most likely (Viterbi) parse of the string; d) posterior expected number of
applications of each grammar production, as required for reestimating rule
probabilities. (a) and (b) are computed incrementally in a single left-to-right
pass over the input. Our algorithm compares favorably to standard bottom-up
parsing methods for SCFGs in that it works efficiently on sparse grammars by
making use of Earley's top-down control structure. It can process any
context-free rule format without conversion to some normal form, and combines
computations for (a) through (d) in a single algorithm. Finally, the algorithm
has simple extensions for processing partially bracketed inputs, and for
finding partial parses and their likelihoods on ungrammatical inputs.Comment: 45 pages. Slightly shortened version to appear in Computational
Linguistics 2
- …