Results 31 to 40 of about 29,886 (270)
Probabilistic Computability and Choice [PDF]
, 2015 We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic ...
Brattka, Vasco +2 more
core +3 more sources
Philosophia Mathematica, 2005 The authors desire to characterize the natural numbers by their structure, as opposed to designating a particular choice of objects like \(\emptyset\), \(\{\emptyset\}\), etc. But at the same time, they wish to rule out nonstandard models -- and not to make their description circular.
Halbach, V, Horsten, LFM
openaire +4 more sources
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
On Accelerations in Science Driven by Daring Ideas: Good Messages from Fallibilistic Rationalism
Studies in Logic, Grammar and Rhetoric, 2015 The first good message is to the effect that people possess reason as a source of intellectual insights, not available to the senses, as e.g. axioms of arithmetic. The awareness of this fact is called rationalism.
Marciszewski Witold
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neuroblastoma is the most common extracranial solid tumor in early childhood. Its clinical behavior is highly variable, ranging from spontaneous regression to fatal outcome despite intensive treatment. The International Society of Pediatric Oncology Europe Neuroblastoma Group (SIOPEN) Radiology and Nuclear Medicine Specialty Committees ...
Annemieke Littooij +11 more
wiley +1 more source
Asymptotic density, immunity, and randomness
, 2015 In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases.
Astor, Eric P.
core +1 more source
The Computational Complexity of Propositional Cirquent Calculus [PDF]
, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Chemotherapy‐induced peripheral neuropathy remains a major complication in pediatric cancer, with disrupted somatosensory and nociceptive processing being a key aspect. This review synthesizes empirical studies on alterations in somatosensory and nociceptive processing in children and adolescents with cancer.
Julia Schweiger +4 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Primary lung carcinomas and bronchial carcinoid tumors (BC) are very rare malignancies in childhood. While typical BC and mucoepidermoid carcinomas are mostly low‐grade, localized tumors with a more favorable prognosis than in adults, necessitating avoidance of overtreatment, adenocarcinomas of the lung are often diagnosed at advanced disease ...
Michael Abele +19 more
wiley +1 more source