Computation in Mind 1 C OMPUTATION IN
نویسنده
چکیده
Like Philosophy, Mathematics deals with abstract ideas, i.e. immaterial objects which inhabit and work in the Mind. The chapter “Computation in Mind” proposes to use the power of computational mathematics to explore some of the universal ways by which each human mind builds its “imago mundi”, its image of the world. The primary focus is put on epistemology and the use of mathematics is minimal, relegating the necessary technical details to an appendix. The Chapter develops the viewpoint that Science and Mind are mirror images for each other which use specific calculations over three kinds of numbers. It presents some epistemological consequences of the lack of associativity or commutativity for the two basic operations which are × and + when the calculations are performed over vectors or over matrices. The evolutive nature of the scientific logic is illustrated on several examples. In particular induction in computation suggests that any matrix ring can be usefully considered as a structure of macro-scalars.
منابع مشابه
On the Logical Foundations of Staged Computation (Invited talk)
Dividing a omputation into stages and optimizing later phases using information from earlier phases is a familiar te hniquein algorithm design. In the realm of programming languages, staged omputation has found two important realizations:partial evaluation and run-time ode generation. A priori, these are fundamentally operational on epts, on erned with howa program exe utes, but...
متن کاملA C Lustering H Euristic for M Ultiprocessor E Nvironments Using C Omputation and C Ommunication L Oads of M
In this paper, we have developed a heuristic for the task allocation problem on a fully connected homogeneous multiprocessor environment. Our heuristic is based on a value associated with the modules called the Computation-Communication-Load (CCLoad). This value is dependent on the computation and the communication times associated with the module. Using the concept of CCLoad, we propose a clus...
متن کاملDistributed Scientific Computation With JavaSpaces?
Java-based tuplespa es provide a new avenue of exploration for distributed omputing with ommodity te hnology. This paper presents early results from our investigation of JavaSpa es for s ienti omputation. We dis uss weaknesses as revealed by our attempts to map existing parallel algorithms to the JavaSpa es model, and use low-level metri s to argue that several lasses of problems are not eÆ ien...
متن کاملBit - Parallel Computation of Lo al Similarity S ore Matri es with Unitary
Abstra t. Lo al similarity omputation between two sequen es permits dete ting all the relevant alignments present between subsequen es thereof. A well-known dynami programming algorithm works in time O(mn), m and n being the lengths of the subsequen es. The algorithm is rather slow when applied over many sequen e pairs. In this paper we present the rst bit-parallel omputation of the s ore matri...
متن کاملBit - Parallel Computation of Lo al Similarity S ore Matri es with Unitary Weights
Abstra t. Lo al similarity omputation between two sequen es permits dete ting all the relevant alignments present between subsequen es thereof. A well-known dynami programming algorithm works in time O(mn), m and n being the lengths of the subsequen es. The algorithm is rather slow when applied over many sequen e pairs. In this paper we present the rst bit-parallel omputation of the s ore matri...
متن کامل