Results 1  10
of
15
Foundations Of Nonstandard Analysis  A Gentle Introduction to Nonstandard Extemsions
 In Nonstandard analysis (Edinburgh
"... this paper is to describe the essential features of the resulting frameworks without getting bogged down in technicalities of formal logic and without becoming dependent on an explicit construction of a specific field ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
this paper is to describe the essential features of the resulting frameworks without getting bogged down in technicalities of formal logic and without becoming dependent on an explicit construction of a specific field
Modelling of Complex Software Systems: a Reasoned Overview
"... This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are na ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This paper is devoted to the presentation of the key concepts on which a mathematical theory of complex (industrial) systems can be based. We especially show how this formal framework can capture the realness of modern information technologies. We also present some new modelling problems that are naturally emerging in the specific context of complex software systems.
Towards a functional formalism for modelling complex industrial systems
 ComPlexUs, special Issue : Complex Systems  European Conference 2005
, 2006
"... This paper is dedicated to the memory of Imre Lakatos ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
This paper is dedicated to the memory of Imre Lakatos
A Rigorous Real Time Feynman Path Integral and Propagator
 J. Phys. A: Math. Gen
"... This work partially fulfills the author’s Ph.D. thesis requirements ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This work partially fulfills the author’s Ph.D. thesis requirements
Neutrosophic logics on NonArchimedean Structures
 Critical Review, Creighton University, USA
"... We present a general way that allows to construct systematically analytic calculi for a large family of nonArchimedean manyvalued logics: hyperrationalvalued, hyperrealvalued, and padic valued logics characterized by a special format of semantics with an appropriate rejection of Archimedes ’ ax ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a general way that allows to construct systematically analytic calculi for a large family of nonArchimedean manyvalued logics: hyperrationalvalued, hyperrealvalued, and padic valued logics characterized by a special format of semantics with an appropriate rejection of Archimedes ’ axiom. These logics are built as different extensions of standard manyvalued logics (namely, Lukasiewicz’s, Gödel’s, Product, and Post’s logics). The informal sense of Archimedes ’ axiom is that anything can be measured by a ruler. Also logical multiplevalidity without Archimedes ’ axiom consists in that the set of truth values is infinite and it is not wellfounded and wellordered. We consider two cases of nonArchimedean multivalued logics: the first with manyvalidity in the interval [0, 1] of hypernumbers and the second with manyvalidity in the ring Zp of padic integers. On the base of nonArchimedean valued logics, we construct nonArchimedean valued interval neutrosophic logics by which we can describe neutrality phenomena.
INTERNAL TURING MACHINES
, 2004
"... Abstract. Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We will show the following. The internal deterministic Turing machines can do in ∗polynomial time what a classical deterministic Turing machine can do in an arbitrary finite amount of time. Given an element of < ∗ M; ∗ x> ∈ Halt (more precisely, the ∗embedding of Halt), there is an internal deterministic Turing machine which will take < ∗ M; ∗ x> as input and halt in the ”yes ” state, and for < ∗ M; ∗ x>/ ∈ Halt, the internal deterministic Turing machine will halt in the ”no ” state. The language ∗ HALT can not be decided by the internal deterministic Turing machines. The internal deterministic Turing machines can be viewed as the asymptotic behavior of finite precision approximation to real number computations. It is possible to use the internal probabilistic Turing machines to simulate finite state quantum mechanics with infinite precision. This simulation suggests that no information can be transmitted instantaneously and at the same time, the Turing machine model can simulate instantaneous collapse of the wave function. The internal deterministic Turing machines are powerful, but if P = NP, then there are internal problems which the internal deterministic Turing machines can solve but not in ∗polynomial time. 1. Introduction. Nonstandard
algorithm proposed
, 2005
"... The goals of this paper are to show the following. First, Grover’s algorithm can be viewed as a digital approximation to the analog quantum ..."
Abstract
 Add to MetaCart
(Show Context)
The goals of this paper are to show the following. First, Grover’s algorithm can be viewed as a digital approximation to the analog quantum
NonStandard Semantics of Hybrid Systems Modelers ✩
"... Hybrid system modelers have become a corner stone of complex embedded system development. Embedded systems include not only control components and software, but also physical devices. In this area, Simulink is a de facto standard design framework, and Modelica a new player. However, such tools raise ..."
Abstract
 Add to MetaCart
(Show Context)
Hybrid system modelers have become a corner stone of complex embedded system development. Embedded systems include not only control components and software, but also physical devices. In this area, Simulink is a de facto standard design framework, and Modelica a new player. However, such tools raise several issues related to the lack of reproducibility of simulations (sensitivity to simulation parameters and to the choice of a simulation engine). In this paper we propose using techniques from nonstandard analysis to define a semantic domain for hybrid systems. Nonstandard analysis is an extension of classical analysis in which infinitesimal (the ε and η in the celebrated generic sentence ∀ε∃η... of college maths) can be manipulated as first class citizens. This approach allows us to define both a denotational semantics, a constructive semantics, and a Kahn Process Network semantics for hybrid systems, thus establishing simulation engines on a sound but flexible mathematical foundation. These semantics offer a clear distinction between the concerns of
A DEFENCE OF MATHEMATICAL PLURALISM
, 2004
"... We approach the philosophy of mathematics via a discussion of the differences between classical mathematics and constructive mathematics, arguing that each is a valid activity within its own context. ..."
Abstract
 Add to MetaCart
(Show Context)
We approach the philosophy of mathematics via a discussion of the differences between classical mathematics and constructive mathematics, arguing that each is a valid activity within its own context.