computer Computer2 2009-03-04 11:50:48 2009-03-04 12:18:40 Definition program automaton logical instructions % this is the default PlanetMath preamble. as your knowledge % almost certainly you want these \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsfonts} % define commands here \usepackage{amsmath, amssymb, amsfonts, amsthm, amscd, latexsym} \usepackage{xypic} \usepackage[mathscr]{eucal} \theoremstyle{plain} \newtheorem{lemma}{Lemma}[section] \newtheorem{proposition}{Proposition}[section] \newtheorem{theorem}{Theorem}[section] \newtheorem{corollary}{Corollary}[section] \theoremstyle{definition} \newtheorem{definition}{Definition}[section] \newtheorem{example}{Example}[section] %\theoremstyle{remark} \newtheorem{remark}{Remark}[section] \newtheorem*{notation}{Notation} \newtheorem*{claim}{Claim} \renewcommand{\thefootnote}{\ensuremath{\fnsymbol{footnote%%@ }}} \numberwithin{equation}{section} \newcommand{\Ad}{{\rm Ad}} \newcommand{\Aut}{{\rm Aut}} \newcommand{\Cl}{{\rm Cl}} \newcommand{\Co}{{\rm Co}} \newcommand{\DES}{{\rm DES}} \newcommand{\Diff}{{\rm Diff}} \newcommand{\Dom}{{\rm Dom}} \newcommand{\Hol}{{\rm Hol}} \newcommand{\Mon}{{\rm Mon}} \newcommand{\Hom}{{\rm Hom}} \newcommand{\Ker}{{\rm Ker}} \newcommand{\Ind}{{\rm Ind}} \newcommand{\IM}{{\rm Im}} \newcommand{\Is}{{\rm Is}} \newcommand{\ID}{{\rm id}} \newcommand{\GL}{{\rm GL}} \newcommand{\Iso}{{\rm Iso}} \newcommand{\Sem}{{\rm Sem}} \newcommand{\St}{{\rm St}} \newcommand{\Sym}{{\rm Sym}} \newcommand{\SU}{{\rm SU}} \newcommand{\Tor}{{\rm Tor}} \newcommand{\U}{{\rm U}} \newcommand{\A}{\mathcal A} \newcommand{\Ce}{\mathcal C} \newcommand{\D}{\mathcal D} \newcommand{\E}{\mathcal E} \newcommand{\F}{\mathcal F} \newcommand{\G}{\mathcal G} \newcommand{\Q}{\mathcal Q} \newcommand{\R}{\mathcal R} \newcommand{\cS}{\mathcal S} \newcommand{\cU}{\mathcal U} \newcommand{\W}{\mathcal W} \newcommand{\bA}{\mathbb{A}} \newcommand{\bB}{\mathbb{B}} \newcommand{\bC}{\mathbb{C}} \newcommand{\bD}{\mathbb{D}} \newcommand{\bE}{\mathbb{E}} \newcommand{\bF}{\mathbb{F}} \newcommand{\bG}{\mathbb{G}} \newcommand{\bK}{\mathbb{K}} \newcommand{\bM}{\mathbb{M}} \newcommand{\bN}{\mathbb{N}} \newcommand{\bO}{\mathbb{O}} \newcommand{\bP}{\mathbb{P}} \newcommand{\bR}{\mathbb{R}} \newcommand{\bV}{\mathbb{V}} \newcommand{\bZ}{\mathbb{Z}} \newcommand{\bfE}{\mathbf{E}} \newcommand{\bfX}{\mathbf{X}} \newcommand{\bfY}{\mathbf{Y}} \newcommand{\bfZ}{\mathbf{Z}} \renewcommand{\O}{\Omega} \renewcommand{\o}{\omega} \newcommand{\vp}{\varphi} \newcommand{\vep}{\varepsilon} \newcommand{\diag}{{\rm diag}} \newcommand{\grp}{{\mathbb G}} \newcommand{\dgrp}{{\mathbb D}} \newcommand{\desp}{{\mathbb D^{\rm{es}}}} \newcommand{\Geod}{{\rm Geod}} \newcommand{\geod}{{\rm geod}} \newcommand{\hgr}{{\mathbb H}} \newcommand{\mgr}{{\mathbb M}} \newcommand{\ob}{{\rm Ob}} \newcommand{\obg}{{\rm Ob(\mathbb G)}} \newcommand{\obgp}{{\rm Ob(\mathbb G')}} \newcommand{\obh}{{\rm Ob(\mathbb H)}} \newcommand{\Osmooth}{{\Omega^{\infty}(X,*)}} \newcommand{\ghomotop}{{\rho_2^{\square}}} \newcommand{\gcalp}{{\mathbb G(\mathcal P)}} \newcommand{\rf}{{R_{\mathcal F}}} \newcommand{\glob}{{\rm glob}} \newcommand{\loc}{{\rm loc}} \newcommand{\TOP}{{\rm TOP}} \newcommand{\wti}{\widetilde} \newcommand{\what}{\widehat} \renewcommand{\a}{\alpha} \newcommand{\be}{\beta} \newcommand{\ga}{\gamma} \newcommand{\Ga}{\Gamma} \newcommand{\de}{\delta} \newcommand{\del}{\partial} \newcommand{\ka}{\kappa} \newcommand{\si}{\sigma} \newcommand{\ta}{\tau} \newcommand{\lra}{{\longrightarrow}} \newcommand{\ra}{{\rightarrow}} \newcommand{\rat}{{\rightarrowtail}} \newcommand{\oset}[1]{\overset {#1}{\ra}} \newcommand{\osetl}[1]{\overset {#1}{\lra}} \newcommand{\hr}{{\hookrightarrow}} \begin{definition} Any automaton $\mathcal{C}$ which is capable of either executing a set of logical instructions $\mathbb{I}$ (that is called a {\em program}, $\mathbb{P}$) or whose operation is defined either by an algorithm/finite set of algorithms $\A$ or a recursive function $\mathcal{F}_R$ is called a \emph{computer}. \end{definition} \subsection{Remarks} Occasionally, and incompletely, a computer is simply being defined as ``{\em a machine that manipulates data according to a list of instructions.}''. First of all, implicit in the latter description is the concept of \emph{sequential machine} or \emph{automaton} that has a precise mathematical definition, not simply just any `machine'. Secondly, the vague term of ``list of instructions'' needs actually be replaced by a ``set of {\bf logical} instructions'', which is precisely defined, for example by algorithms or recursive functions as in the top definition of the computer term. Notably, and contrary to widespread misconceptions in old-age philosophy ( e.g. Descartes, John von Neumann, etc.), AI and the computer community, complex, living systems and the human brain cannot be adequately described or represented by any computer, computer model, or classical automaton, in essence because the latter cannot be adequately modelled by any recursive function, finitary algorithm or (computer) program. Furthermore, any computer can be encoded with a categorical commutative diagram. On the other hand, most organisms-- that possess variable topology and varying transition functions $\delta_v$ (viz. entry on automata)-- may only be encoded by the unique limit of a sequence of non-commutative categorical diagrams which is not necessarily finite, and that cannot be {\em recursively} computed.