Results 1  10
of
17
Recursion Theory and Ordinal Com putability
"... Motivated by a talk of S. D. Friedman at BIWOC we show that the recursive and recursively enumerable sets of G. Sacks ' s recursion theory are exactly those sets that are recursive and recursively enumerable by an ordinal Turing machines with tapes of length and time bound . 1 Introduction ..."
Abstract
 Add to MetaCart
Motivated by a talk of S. D. Friedman at BIWOC we show that the recursive and recursively enumerable sets of G. Sacks ' s recursion theory are exactly those sets that are recursive and recursively enumerable by an ordinal Turing machines with tapes of length and time bound . 1
König’s Lemma and Kleene Tree
, 2006
"... I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably noncompact. This is in sharp contrast with the classical theorem that Cantor space is compact. The note is written for mathematicians with classical training in topology an ..."
Abstract
 Add to MetaCart
I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably noncompact. This is in sharp contrast with the classical theorem that Cantor space is compact. The note is written for mathematicians with classical training in topology
A Swiss Pocket Knife for Computability
"... This research is about operational and complexityoriented aspects of classical foundations of computability theory. The approach is to reexamine some classical theorems and constructions, but with new criteria for success that are natural from a programming language perspective. Three cornerston ..."
Abstract
 Add to MetaCart
This research is about operational and complexityoriented aspects of classical foundations of computability theory. The approach is to reexamine some classical theorems and constructions, but with new criteria for success that are natural from a programming language perspective. Three
Some natural decision problems in automatic graphs. 2008. Available from http://www.informatik.unileipzig.de/∼lohrey
"... Abstract. For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler path, bounding the number of ends, and bounding the number of infinite branches in a tree (C) existence of an ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
in computability theory. A structure is recursive, if its domain is a recursive set of naturals, and every relation is again recursive. Starting with the work of Man
Embedded Zassenhaus Expansion to Operator Splitting Schemes: Theory and Application in Fluid Dynamics
, 2014
"... In this paper, we contribute operatorsplitting methods improved by the Zassenhaus product for the numerical solution of linear partial differential equations. We address iterative splitting methods, that can be improved by means of the Zassenhaus product formula, which is a sequnential splitting s ..."
Abstract
 Add to MetaCart
higher order commutators, we combine such an improved initialization process to cheap computable to linear convergent iterative splitting schemes. Theoretical discussion about convergence and application examples are discussed with CFD problems.
Computability and Algorithmic Complexity in Economics
, 2012
"... Rabin's effectivization of the GaleStewart Game [42] remains the model methodological contribution to the field for which Velupillai coined the name Computable Economics more than 20 years ago. Alain Lewis was the first to link Rabin's work with Simon's fertile concept of bounded rat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and nance theories. We try to place, in the context of the development of computable economics, some of the classics of the subject as well as those that have,
A Probabilistic Strategy Language for Probabilistic Rewrite Theories and its Application to Cloud Computing
, 2014
"... Abstract. Several formal models combine probabilistic and nondeterministic features. To allow their probabilistic simulation and statistical model checking by means of pseudorandom number sampling, all sources of nondeterminism must first be quantified. However, current tools offer limited flexibi ..."
Abstract
 Add to MetaCart
on the current system state, and their associated weight expressions can be given by any computable function defined equationally in Maude. We have implemented PSMaude, a tool that extends Maude with a probabilistic simulator and a statistical model checker for our language. We illustrate the convenience
A Computable Kolmogorov Superposition Theorem
 In
, 2000
"... In the year 1900 in his famous lecture in Paris Hilbert formulated 23 challenging problems which inspired many ground breaking mathematical investigations in the last century. Among these problems the 13th was concerned with the solution of higher order algebraic equations. Hilbert conjectured that ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
framework of computable analysis: each multivariate computable realvalued function can be represented as superposition and composition of computable real number functions of only one variable and such a representation can even be determined eectively. As a consequence one obtains a characterization
Uncertainty, Political Preferences, and Stabilization: Stochastic Control Using Dynamic CGE Models
, 2003
"... Abstract. This paper is a step toward the merger of optimal control models with dynamic computable general equilibrium (CGE) models. It demonstrates the usefulness of CGE techniques in control theory application and provides a practical guideline to policymakers in this relatively new field. Uncert ..."
Abstract
 Add to MetaCart
Abstract. This paper is a step toward the merger of optimal control models with dynamic computable general equilibrium (CGE) models. It demonstrates the usefulness of CGE techniques in control theory application and provides a practical guideline to policymakers in this relatively new field
FAST: A transducerbased language for tree manipulation
, 2012
"... Tree automata and tree transducers are used in a wide range of applications in software engineering, from XML processing to language typechecking. While these formalisms are of immense practical use, they can only model finite alphabets, and since many realworld applications operate over infinit ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a highlevel language called Fast that acts as a frontend for the above formalisms. Fast supports symbolic alphabets through tight
Results 1  10
of
17