Results 1  10
of
18
CodeGeneration OntheFly: A Key to Portable Software
, 1994
"... A technique for representing programs abstractly and independently of the eventual target architecture is presented that yields a file representation twice as compact as machine code for a CISC processor. It forms the basis of an implementation, in which the process of code generation is deferred ..."
Abstract

Cited by 53 (19 self)
 Add to MetaCart
A technique for representing programs abstractly and independently of the eventual target architecture is presented that yields a file representation twice as compact as machine code for a CISC processor. It forms the basis of an implementation, in which the process of code generation is deferred until the time of loading. At that point, native code is created on_the_fly by a code_generating loader. The process of loading with dynamic code_generation is so fast that it requires little more time than the input of equivalent native code from a disk storage medium. This is predominantly due to the compactness of the abstract program representation, which allows to counterbalance the ad...
FMC: An Approach towards ArchitectureCentric System Development
 IEEE Symposium and Workshop on Engineering of Computer Based Systems
, 2003
"... The architectural level plays a major role in the engineering of computer based systems. Having proper means for representing the architecture of a system is a crucial element of large system development efforts as it reduces the amount of uncertainty among the involved stakeholders. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
The architectural level plays a major role in the engineering of computer based systems. Having proper means for representing the architecture of a system is a crucial element of large system development efforts as it reduces the amount of uncertainty among the involved stakeholders.
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
, 2009
"... It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f: A → B, additional structural information about the input x ∈ A (that is any kind of promise that x belongs to a certain subset A ′ ⊆ A) should be taken advantage of. Some examples from ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f: A → B, additional structural information about the input x ∈ A (that is any kind of promise that x belongs to a certain subset A ′ ⊆ A) should be taken advantage of. Some examples from real number computation show that such discrete advice can even make the difference between computability and uncomputability. We turn this into a both topological and combinatorial complexity theory of information, investigating for several practical problems how much advice is necessary and sufficient to render them computable. Specifically, finding a nontrivial solution to a homogeneous linear equation A · x = 0 for a given singular real n × nmatrix A is possible when knowing rank(A) ∈ {0, 1,..., n−1}; and we show this to be best possible. Similarly, diagonalizing (i.e. finding a basis of eigenvectors of) a given real symmetric n × nmatrix A is possible when knowing the number of distinct eigenvalues: an integer between 1 and n (the latter corresponding to the nondegenerate case). And again we show that n–fold (i.e. roughly log n bits of) additional information is indeed necessary in order to render this problem (continuous and) computable; whereas finding some single eigenvector of A requires and suffices with Θ(log n)–fold advice.
A direct construction of a universal extended H system
 MCU
, 2001
"... We describe a direct construction of a universal extended H system. The system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct construction is described: universal results obtained until now were based on the simulation o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe a direct construction of a universal extended H system. The system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct construction is described: universal results obtained until now were based on the simulation of universal type0 grammars or Turing machines.
Church’s Thesis and Functional Programming
 JOURNAL OF UNIVERSAL COMPUTER SCIENCE
, 2004
"... The earliest statement of Church’s Thesis, from Church (1936) p356 is
We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambda definable function of positiv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The earliest statement of Church’s Thesis, from Church (1936) p356 is
We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambda definable function of positive integers).
The phrase in parentheses refers to the apparatus which Church had developed to investigate this and other problems in the foundations of mathematics: the calculus of lambda conversion. Both the Thesis and the lambda calculus have been of seminal influence on the development of Computing Science. The main subject of this article is the lambda calculus but I will begin with a brief sketch of the emergence of the Thesis.
DIPLOMARBEIT Development of a Phenotype Algorithm for Particle Geometry Optimization
"... durch ..."
(Show Context)
A Formal System for Defining the Syntax and Semantics of Computer Languages
, 1969
"... The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and i ..."
Abstract
 Add to MetaCart
The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language, and (2) the formalisms of the lcalculus and extended Markov algorithms as a combined formalism used as the basis of a target language for defining the semantics of a computer language.
Applications and Technologies for Maritime and Offshore Industries. Technological Significance of Early Norwegian Applications
"... Abstract. Autokon, a CAD/CAM system for ships, was one of the most important early Norwegian applications. We describe the background for the Autokon project and its results. We will specifically follow three technology threads that we have called Datacentred architectures, Mathematical modelling, ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Autokon, a CAD/CAM system for ships, was one of the most important early Norwegian applications. We describe the background for the Autokon project and its results. We will specifically follow three technology threads that we have called Datacentred architectures, Mathematical modelling, and Personal information systems, where the last one includes distribution and component based architectures. An important part of the Autokon background is the history of the earliest computers in Britain and Norway. We therefore start with a brief history of computing. 1
—脳・ロボット・人間研究における新たな展開— Simple Algorithmic Theory of Subjective Beauty,
"... In this summary of previous work, I argue that data becomes temporarily interesting by itself to some selfimproving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way, thus making it subjectively more “beautiful. ” Curiosity is the des ..."
Abstract
 Add to MetaCart
In this summary of previous work, I argue that data becomes temporarily interesting by itself to some selfimproving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way, thus making it subjectively more “beautiful. ” Curiosity is the desire to create or discover more nonrandom, nonarbitrary, “truly novel, ” regular data that allows for compression progress because its regularity was not yet known. This drive maximizes “interestingness, ” the first derivative of subjective beauty or compressibility, that is, the steepness of the learning curve. It motivates exploring infants, pure mathematicians, composers, artists, dancers, comedians, yourself, and recent artificial systems. 1.