<--- Back to Details
First PageDocument Content
Computing / Reverse computation / Abstraction / Logic simulation / Particle-in-cell / Continuous simulation / DEVS / Computer simulation / Discrete event simulation / Scientific modeling / Simulation / Science
Date: 2005-10-24 22:52:54
Computing
Reverse computation
Abstraction
Logic simulation
Particle-in-cell
Continuous simulation
DEVS
Computer simulation
Discrete event simulation
Scientific modeling
Simulation
Science

Add to Reading List

Source URL: www.cs.mcgill.ca

Download Document from Source Website

File Size: 742,95 KB

Share Document on Facebook

Similar Documents

Mathematics / Computability theory / Theoretical computer science / Theory of computation / Reverse mathematics / Computable function / Graph coloring / Randomness / Rand / RAND Corporation

Intro RAND & DNC WWKL & RWWKL

DocID: 1nNfY - View Document

Mathematics / Mathematical analysis / Theory of computation / Computability theory / Theoretical computer science / Computation in the limit / Computable function / Differential forms on a Riemann surface / Congruence lattice problem

DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti

DocID: 1nMjn - View Document

Mathematical logic / Computability theory / Mathematics / Theoretical computer science / Proof theory / Logic in computer science / Theory of computation / Second-order arithmetic / Combinatory logic / Reverse mathematics / Computable function

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

DocID: 1nv8Y - View Document

Computability theory / Theory of computation / Computable number / Computable function / 01 class / Computation in the limit

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

DocID: 1nsis - View Document

Computability theory / Mathematical logic / Proof theory / Theory of computation / Logic in computer science / Computable function / Reverse mathematics / PA degree / Peano axioms

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

DocID: 1ni5y - View Document