Results 11 to 20 of about 461,649 (298)

A Note on the Reality of Incomputable Real Numbers and Its Systemic Significance

Systems, 2021
We discuss mathematical and physical arguments contrasting continuous and discrete, limitless discretization as arbitrary granularity. In this regard, we focus on Incomputable (lacking an algorithm that computes in finite time) Real Numbers (IRNs).
Gianfranco Minati
doaj   +1 more source

Da metamatemática para a ciência cognitiva From metamathematics to Cognitive Science

Trans/Form/Ação, 1999
Neste artigo, propõe-se uma configuração possível para a transição histórico-filosófica de temas investigados no domínio da metamatemática para o domínio da Ciência Cognitiva funcionalista neurocomputacional. A descrição de tal transição é feita por meio
Henrique de Morais Ribeiro
doaj   +1 more source

Robust non-computability of dynamical systems and computability of robust dynamical systems [PDF]

Logical Methods in Computer Science
In this paper, we examine the relationship between the stability of the dynamical system $x^{\prime}=f(x)$ and the computability of its basins of attraction.
Daniel S. Graça, Ning Zhong
doaj   +1 more source

Computability of 1-manifolds [PDF]

Logical Methods in Computer Science, 2014
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable.
Konrad Burnik, Zvonko Iljazovic
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

Verification using counterexample fragment based specification relaxation: case of modular/concurrent linear hybrid automata

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, Jing Huang, Jing Huang, Shengbing Jiang, Ratnesh Kumar   +4 more
doaj   +1 more source

Approximation systems for functions in topological and in metric spaces [PDF]

Logical Methods in Computer Science, 2013
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names.
Dimiter Skordev
doaj   +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, Mathias Soeken, Mathias Soeken, Robert Wille, Rolf Drechsler   +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, Xingwu Liu, Fengchun Lei, Jie Wu   +3 more
doaj   +1 more source

Effective Procedures

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