Sökning: "computation"

Visar resultat 16 - 20 av 767 avhandlingar innehållade ordet computation.

  1. 16. The Mathematician as Mathematics : Theories of Computation in Light of Wittgenstein's Thought

    Författare :Kim Solin; Lars-Göran Johansson; Sören Stenlund; André Porto; Uppsala universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; theories of computation; philosophy of mathematics; Wittgenstein;

    Sammanfattning : Theories of computation are considered in light of Wittgenstein's thought. The dissertation is divided into three parts.The first part presents the philosophical approach taken in the dissertation. The approach takes Wittgenstein's philosophy, in particular as it has been understood by Rush Rhees, as a model. LÄS MER

  2. 17. Computation of constraints in bimetric theory

    Författare :Anders Lundkvist; Fawad Hassan; Edwin Langmann; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; teoretisk fysik; Theoretical Physics;

    Sammanfattning : The Hassan-Rosen bimetric theory describes two interacting spin-2 fields, one massless and one massive. In this thesis, a complete canonical analysis of this theory is performed in the metric formulation and all constraints are computed. LÄS MER

  3. 18. On the Power of Quantum Computation: Oracles

    Författare :Niklas Johansson; Jan-Åke Larsson; Peter Jonsson; Göran Johansson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Quantum computation solve some computational problems faster than the best-known alternative in classical computation. The evidence for this consists of examples where a quantum algorithm outperforms the best-known classical algorithm. LÄS MER

  4. 19. Reference and Computation in Intuitionistic Type Theory

    Författare :Johan G Granström; Erik Palmgren; Per Martin-Löf; Peter Dybjer; Uppsala universitet; []
    Nyckelord :mathematical logic; intuitionism; type theory; foundations of mathematics;

    Sammanfattning : Three topics, namely, computer science, philosophical logic, and mathematics, meet in intuitionistic type theory, which thus simultaneously is a programming language, a philosophy of language, and a foundation of mathematics. The present thesis compares, relates, and equates two concepts, one from philosophical logic and one from computer science, viz. LÄS MER

  5. 20. Computation of Parameters in some Mathematical Models

    Författare :Gunilla Wikström; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; inverse problems; parameter estimation; systems of ordinary differential equations; short-cut methods; separable nonlinear least squares problems; Matlab toolbox for nonlinear least squares ; linear systems of equations; pseudoinverse solution; perturbation theory; singular value decomposition; experimental error analysis; Computer science; Datavetenskap;

    Sammanfattning : In computational science it is common to describe dynamic systems by mathematical models in forms of differential or integral equations. These models may contain parameters that have to be computed for the model to be complete. LÄS MER