Sciweavers

2253 search results - page 56 / 451
» Computing with Realizational Morphology
Sort
View
AML
2010
104views more  AML 2010»
15 years 4 months ago
Degrees of categoricity of computable structures
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
TIP
2010
119views more  TIP 2010»
14 years 11 months ago
Software Designs of Image Processing Tasks With Incremental Refinement of Computation
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
Davide Anastasia, Yiannis Andreopoulos
TBILLC
2005
Springer
15 years 9 months ago
The Main Devices of Foregrounding in the Information Structure of Georgian Sentences
Structuring of information proceeds through the foregrounding of certain parts of the information. In general, foregrounding can be realized on various linguistic levels and it is...
Rusudan Asatiani
JUCS
2008
140views more  JUCS 2008»
15 years 4 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
CIE
2007
Springer
15 years 10 months ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone