Results 31 to 40 of about 1,948,017 (269)
Effective zero-dimensionality for computable metric spaces [PDF]
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent.
Kenny, Robert
core +1 more source
Computational differential topology
Some of the more differential aspects of the nascent field of computational topology are introduced and treated in considerable depth. Relevant categories based upon stratified geometric objects are proposed, and fundamental problems are identified and ...
Denis Blackmore, Yuriy Mileyko
doaj +1 more source
Conway games, algebraically and coalgebraically [PDF]
Using coalgebraic methods, we extend Conway's theory of games to possibly non-terminating, i.e. non-wellfounded games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we ...
Furio Honsell, Marina Lenisa
doaj +1 more source
Fundamental Results of Cyclic Codes over Octonion Integers and Their Decoding Algorithm
Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection, error correction, data transmission, and data storage.
Muhammad Sajjad +4 more
doaj +1 more source
Aspects of assessment of students’ activity in the seminar classes: problems and solutions [PDF]
Given paper is presented as a theoretical-applied study that falls within the scientific dimensions of the theory and methodology of didactic evaluation.
BURLACU, Natalia
doaj +1 more source
Practice-oriented controversies and borrowed epistemic credibility in current evolutionary biology: phylogeography as a case study [PDF]
Although there is increasing recognition that theory and practice in science are intimately intertwined, philosophy of science perspectives on scientific controversies have been historically focused on theory rather than practice.
Arroyo-Santos, Alfonso +2 more
core +3 more sources
In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial coefficients ...
Shirokov, D. S.
core +1 more source
On the strength of proof-irrelevant type theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover.
Werner, Benjamin
core +1 more source
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an
A. Ambainis +9 more
core +3 more sources
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation [PDF]
AC-completion efficiently handles equality modulo associative and commutative function symbols. When the input is ground, the procedure terminates and provides a decision algorithm for the word problem.
Evelyne Contejean +3 more
core +6 more sources

