Results 21 to 30 of about 3,053,426 (341)
COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS [PDF]
Journal of Symbolic Logic (JSL), 2017 We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related.
D. Normann, Sam Sanders
semanticscholar +1 more source
Computational crystallization [PDF]
Archives of Biochemistry and Biophysics, 2016 Crystallization is a key step in macromolecular structure determination by crystallography. While a robust theoretical treatment of the process is available, due to the complexity of the system, the experimental process is still largely one of trial and error.
Altan, Irem +2 more
openaire +3 more sources
The Digital and the Real Universe Foundations of Natural Philosophy and Computational Physics
Philosophies, 2019 In the age of digitization, the world seems to be reducible to a digital computer. However, mathematically, modern quantum field theories do not only depend on discrete, but also continuous concepts.
Klaus Mainzer
doaj +1 more source
The Computational and Pragmatic Approach to the Dynamics of Science [PDF]
Filozofia i Nauka, 2020 Science means here mathematics and those empirical disciplines which avail themselves of mathematical models. The pragmatic approach is conceived in Karl R. Popper’s The Logic of Scientific Discovery (p.
Witold Marciszewski
doaj +1 more source
IEEE Transactions on Signal Processing, 2019 Secret key generation refers to the problem of generating a common secret key without revealing any information about it to an eavesdropper. All users observe correlated components of a common source and can further use a noisy public channel for ...
H. Boche +3 more
semanticscholar +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
A Topological Characterization to Arbitrary Resilient Asynchronous Complexity
Mathematics, 2022 In this work, we extend the topology-based framework and method for the quantification and classification of general resilient asynchronous complexity.
Yunguang Yue +3 more
doaj +1 more source
Computability of Følner sets [PDF]
International journal of algebra and computation, 2016 We define the notion of computability of Folner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich groups, finitely presented solvable groups with unsolvable Word Problem, have computable Folner sets.
Matteo Cavaleri
semanticscholar +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
Philosophies, 2023 The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that ...
Nathan Salmon
doaj +1 more source