Results 1  10
of
16
A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS
"... Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally e ..."
Abstract

Cited by 23 (10 self)
 Add to MetaCart
Abstract. Church’s Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingcomputable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church’s Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing’s Thesis, characterizing the effective string functions, and—in particular—the effectivelycomputable functions on string representations of numbers.
Algorithms: A quest for absolute definitions
 Bulletin of the European Association for Theoretical Computer Science
, 2003
"... y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the ChurchTurin ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the ChurchTuring thesis and contrast Church's and Turing's approaches, and we finish with some recent investigations.
In Some Curved Spaces, One Can Solve NPHard Problems in Polynomial Time
"... In the late 1970s and the early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NPhard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved s ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
In the late 1970s and the early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NPhard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces. 1 Introduction and Formulation of the Problem Many practical problems are NPhard. It is well known that many important practical problems are NPhard; see, e.g., [11, 14, 27]. Under the usual hypothesis that P̸=NP, NPhardness has the following intuitive meaning: every algorithm which solves all instances of the corresponding problem requires, for
The Expressive Power Of AbstractState Machines
, 2003
"... STATE MACHINES Wolfgang Reisig Institut fur Informatik Humboldt Universitat zu Berlin Unter den Linden 6 10099 Berlin, Deutschland email: reisig@informatik.huberlin.de Abstract. Conventional computation models assume symbolic representations of states and actions. Gurevich's "A ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
STATE MACHINES Wolfgang Reisig Institut fur Informatik Humboldt Universitat zu Berlin Unter den Linden 6 10099 Berlin, Deutschland email: reisig@informatik.huberlin.de Abstract. Conventional computation models assume symbolic representations of states and actions. Gurevich's "AbstractState Machine" model takes a more liberal position: Any mathematical structure may serve as a state. This results in "a computational model that is more powerful and more universal than standard computation models" [5].
The Generic Model of Computation
"... Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein. 1
An ASMcharacterization of a class of distributed algorithms
 MAY 2006, AVAILABLE AT HTTP://WWW2.INFORMATIK.HUBERLIN.DE/TOP/DOWNLOAD/PUBLICATIONS/ GLAUSCHR2007 DAGSTUHL.PDF (VIEWED MAR. 26, 2008). LONGER VERSION: DISTRIBUTED ABSTRACT STATE MACHINES AND THEIR EXPRESSIVE POWER, INFORMATIKBERICHTE 196, HUMBOLDTUNIVE
, 2006
"... Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, sequences, stacks, etc. Gurevich’s Abstract State Machines (ASMs) take a more liberal position: any firstorder structure may serve as a state. In [7] Gurevich character ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, sequences, stacks, etc. Gurevich’s Abstract State Machines (ASMs) take a more liberal position: any firstorder structure may serve as a state. In [7] Gurevich characterizes the expressive power of sequential ASMs: he defines the class of sequential algorithms by means of only a few, amazingly general requirements and proves this class to be equivalent to sequential ASMs. In this paper we generalize Gurevich’s result to distributed algorithms: we define a class of distributed algorithms by likewise general requirements and show that this class is covered by a distributed computation model based on sequential ASMs.
A Semantic Characterization of UnboundedNondeterministic Abstract State Machines
 In CALCO 2007, Proceedings
, 2007
"... Abstract. Universal algebra usually considers and examines algebras as static entities. In the mid 80ies Gurevich proposed Abstract State Machines (ASMs) as a computation model that regards algebras as dynamic: a state of an ASM is represented by a freely chosen algebra which may change during a com ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Universal algebra usually considers and examines algebras as static entities. In the mid 80ies Gurevich proposed Abstract State Machines (ASMs) as a computation model that regards algebras as dynamic: a state of an ASM is represented by a freely chosen algebra which may change during a computation. In [8] Gurevich characterizes the class of sequential ASMs in a purely semantic way by five amazingly general and elegant axioms. In [9] this result is extended to boundednondeterministic ASMs. This paper considers the general case of unboundednondeterministic ASMs: in each step, an unboundednondeterministic ASM may choose among unboundedly many (sometimes infinitely many) alternatives. We characterize the class of unboundednondeterministic ASMs by an extension of Gurevich’s original axioms for sequential ASMs. We apply this result to prove the reversibility of unboundednondeterministic ASMs. 1
Semantic Blueprints of Discrete Dynamic Systems: Challenges and Needs in Computational Modeling of Complex Behavior
"... How can one cope with the notorious problem of establishing the correctness and completeness of abstract functional requirements in the design of controlintensive software systems prior to actually building the system? The answer given here explores abstract state machines (ASMs): a universal math ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
How can one cope with the notorious problem of establishing the correctness and completeness of abstract functional requirements in the design of controlintensive software systems prior to actually building the system? The answer given here explores abstract state machines (ASMs): a universal mathematical framework for semantic modeling of discrete dynamic systems. Combining common abstraction principles from computational logic and discrete mathematics, ASMs provide a universal model of computation and an effective instrument for analyzing and reasoning about complex semantic properties of realworld systems. Widely recognized applications include semantic foundations of virtually all kinds of architectures, languages and protocols. In this paper we focus on empirical aspects in modeling concurrent and reactive behavior.
Effectiveness
, 2011
"... We describe axiomatizations of several aspects of effectiveness: effectiveness of transitions; effectiveness relative to oracles; and absolute effectiveness, as posited by the ChurchTuring Thesis. ..."
Abstract
 Add to MetaCart
We describe axiomatizations of several aspects of effectiveness: effectiveness of transitions; effectiveness relative to oracles; and absolute effectiveness, as posited by the ChurchTuring Thesis.
In Some Curved Spaces, We Can Solve NPHard Problems in Polynomial Time: Towards Matiyasevich’s Dream
"... In late 1970s and early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NPhard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces. 1 ..."
Abstract
 Add to MetaCart
In late 1970s and early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NPhard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces. 1 Introduction and Formulation of the Problem Many practical problems are NPhard. It is well known that many important practical problems are NPhard; see, e.g., [7, 9, 22]. Under the usual hypothesis that P̸=NP, NPhardness has the following intuitive meaning: every algorithm which solves all the instances of the corresponding problem requires,