Listing 1 - 10 of 78 << page
of 8
>>
Sort by
Reason's nearest kin : philosophies of arithmetic from Kant to Carnap
Author:
ISBN: 019825041X Year: 2000 Publisher: Oxford [etc.] : Oxford University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Reason's nearest kin
Author:
ISBN: 1281944289 9786611944285 0191520225 9780191520228 019825041X 9780199252619 9780198250418 0199252610 Year: 2000 Publisher: Oxford New York Oxford University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Reason's Nearest Kin is a critical examination of the most exciting period there has been in the philosophical study of the properties of the natural numbers, from the 1880s to the 1930s. Reassessing the brilliant innovations of Frege, Russell, Wittgenstein, and others, which transformed philosophy as well as our understanding of mathematics, Michael Potter places arithmetic at the interface between experience, language, thought, and the world.

The principles of computer hardware
Author:
ISBN: 0198564538 0198564546 9780198564546 9780198564539 Year: 2000 Publisher: Oxford Oxford University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

The Principles of Computer Hardware, now in its third edition, provides a readable, tutorial based introduction to the subject for undergraduate computer scientists and engineers.

Introduction to computer law
Author:
ISBN: 0582423341 Year: 2000 Publisher: White Plains (NY) : Longman,

Computers Ltd. : what they really can't do
Author:
ISBN: 0198505558 Year: 2000 Publisher: Oxford ; New York : Oxford University Press,

The Computational Complexity of Equivalence and Isomorphism Problems
Author:
ISBN: 3540410325 3540453032 Year: 2000 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered.

Functional models of cognition : self-organizing dynamics and semantic structures in cognitive systems
Author:
ISBN: 0792360729 9048153603 9401596204 Year: 2000 Volume: 27 Publisher: Dordrecht ; Boston ; London Kluwer academic publishers

Loading...
Export citation

Choose an application

Bookmark

Abstract

Our ontology as well as our grammar are, as Quine affirms, ineliminable parts of our conceptual contribution to our theory of the world. It seems impossible to think of enti­ ties, individuals and events without specifying and constructing, in advance, a specific language that must be used in order to speak about these same entities. We really know only insofar as we regiment our system of the world in a consistent and adequate way. At the level of proper nouns and existence functions we have, for instance, a standard form of a regimented language whose complementary apparatus consists of predicates, variables, quantifiers and truth functions. If, for instance, the discoveries in the field of Quantum Mechanics should oblige us, in the future, to abandon the traditional logic of truth functions, the very notion of existence, as established until now, will be chal­ lenged. These considerations, as developed by Quine, introduce us to a conceptual perspective like the "internal realist" perspective advocated by Putnam whose principal aim is, for cer­ tain aspects, to link the philosophical approaches developed respectively by Quine and Wittgenstein. Actually, Putnam conservatively extends the approach to the problem of ref­ erence outlined by Quine: in his opinion, to talk of "facts" without specifying the language to be used is to talk of nothing.

Verification of digital and hybrid systems : proceedings of a Nato Advanced Study Institute ... held in Antalya, 26 May - 6 June 1997
Authors: --- --- --- ---
ISBN: 3540655956 3642640524 3642596150 Year: 2000 Volume: 170

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book grew out of a NATO Advanced Study Institute summer school that was held in Antalya, TUrkey from 26 May to 6 June 1997. The purpose of the summer school was to expose recent advances in the formal verification of systems composed of both logical and continuous time components. The course was structured in two parts. The first part covered theorem-proving, system automaton models, logics, tools, and complexity of verification. The second part covered modeling and verification of hybrid systems, i. e. , systems composed of a discrete event part and a continuous time part that interact with each other in novel ways. Along with advances in microelectronics, methods to design and build logical systems have grown progressively complex. One way to tackle the problem of ensuring the error-free operation of digital or hybrid systems is through the use of formal techniques. The exercise of comparing the formal specification of a logical system namely, what it is supposed to do to its formal operational description-what it actually does!-in an automated or semi-automated manner is called verification. Verification can be performed in an after-the-fact manner, meaning that after a system is already designed, its specification and operational description are regenerated or modified, if necessary, to match the verification tool at hand and the consistency check is carried out.

Listing 1 - 10 of 78 << page
of 8
>>
Sort by