Results 31 to 40 of about 30,213 (286)
Algorithmic Randomness for Infinite Time Register Machines
, 2014 A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and
A. Kechris +3 more
core +1 more source
IET Cyber-Physical Systems, 2017 We present LhaVrf, a symbolic verifier for the safety verification of concurrent LHA (Linear Hybrid Automaton). A concurrent LHA is composed of a set of LHAs that interact through shared variables and/or events.
Hao Ren +4 more
doaj +1 more source
Computability and Analysis, a Historical Approach
, 2016 The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction to measure ...
Brattka, Vasco
core +1 more source
, 2009 The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html ...
Japaridze, Giorgi
core +6 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background and Aims Wilms tumour (WT) has excellent event‐free and overall survival (OS). However, small differences exist between countries participating in the same international study. This led us to examine variation in adherence to protocol recommendations as a potential contributing factor.
Suzanne Tugnait +23 more
wiley +1 more source
Propositional computability logic I
, 2004 In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a machine against the
Giorgi Japaridze, Lorenzen P., Turing A.
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The management of clinically apparent single lesions or oligofocal nephroblastomatosis, a facultative precursor of nephroblastoma, remains debated. Methods We retrospectively analyzed 37 patients with clinically apparent single or oligofocal nephroblastomatosis (two to three lesions per kidney) among 2347 patients registered between
Nils Welter +17 more
wiley +1 more source
Verifying the structure and behavior in UML/OCL models using satisfiability solvers
IET Cyber-Physical Systems, 2016 Due to the ever increasing complexity of embedded and cyber-physical systems, corresponding design solutions relying on modelling languages such as Unified Modelling Language (UML)/Object Constraint Language (OCL) find increasing attention.
Nils Przigoda +4 more
doaj +1 more source
, 2006 The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering.
Blanqui, Frédéric
core +3 more sources
Computations in Space and Space in Computations [PDF]
, 2005 The emergence of terms like natural computing, mimetic computing, parallel problem solving from nature, bio-inspired computing, neurocomputing, evolutionary computing, etc., shows the never ending interest of the computer scientists for the use of “natural phenomena” as “problem solving devices” or more generally, as a fruitful source of inspiration to
Giavitto, Jean-Louis +3 more
openaire +2 more sources