Transformational Construction of Correct Pointer Algorithms
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Time and Space Complexity of Reversible Pebbling
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
On the Space and Access Complexity of Computation DAGs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Time-Space Tradeoffs on Back-to-Back FFT Algorithms
IEEE Transactions on Computers
Record of the Project MAC conference on concurrent systems and parallel computation
Program Schemes with Deep Pushdown Storage
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Optimizing the stack size of recursive functions
Computer Languages, Systems and Structures
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
A universal modular ACTOR formalism for artificial intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A Comparison of Some Theoretical Models of Parallel Computation
IEEE Transactions on Computers
Characterizations of flowchartable recursions
Journal of Computer and System Sciences
Completeness results for the equivalence of recursive schemas
Journal of Computer and System Sciences
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
A pebble game for internet-based computing
Theoretical Computer Science
On the power of programming features
Computer Languages
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Hi-index | 0.02 |
While we may have the intuitive idea of one programming language having greater power than another, or of some subset of a language being an adequate 'core' for that language, we find when we try to formalize this notion that there is a serious theoretical difficulty. This lies in the fact that even quite rudimentary languages are nevertheless 'universal' in the following sense. If the language allows us to program with simple arithmetic or list-processing functions then any effective control structure can be simulated, traditionally by encoding a Turing machine computation in some way. In particular, a simple language with some basic arithmetic can express programs for any partial recursive function. Such an encoding is usually quite unnatural and impossibly inefficient. Thus in order to carry on a practical study of the comparative power of different languages we are led to banish explicit functions and deal instead with abstract, uninterpreted programs, or schemas. What follows is a brief report on some preliminary exploration in this area.