Sciweavers

2436 search results - page 3 / 488
» Comonadic Notions of Computation
Sort
View
APAL
2007
104views more  APAL 2007»
13 years 5 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
ENTCS
2008
67views more  ENTCS 2008»
13 years 5 months ago
Notions of Probabilistic Computability on Represented Spaces
: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
Volker Bosserhoff
PPSWR
2005
Springer
13 years 10 months ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach
COMPLEXITY
2010
129views more  COMPLEXITY 2010»
13 years 2 months ago
The notion of computation is fundamental to an autonomous neuroscience
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
Garrett Neske
CACM
2002
56views more  CACM 2002»
13 years 4 months ago
Some problems with the notion of context-aware computing
shapes that gradually dissolve into blackness.
Thomas Erickson