Monte Carlo methods and super-recursive algorithms

Authors:
Mark S. Burgin;Maurice J. Ades
Affiliations:
University of California, Los Angeles, CA;Augusta, GA
Venue:
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Year:
2009

Citing 4
Cited 0

Expected gains from parallelizing constraint solving for hard problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solving Time-Dependent Planning Problems

Solving Time-Dependent Planning Problems
Super-Recursive Algorithms (Monographs in Computer Science)

Super-Recursive Algorithms (Monographs in Computer Science)
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies Monte Carlo methods and other stochastic algorithms from the super-recursive algorithmic perspective. Advantages of such super-recursive algorithms as inductive and limit Turing machines are demonstrated.