LEADER 06103nam  22017055  450 
001 9910154745703321
005 20190708092533.0
010   $a1-4008-8261-3
024 7 $a10.1515/9781400882618
035   $a(CKB)3710000000631316
035   $a(MiAaPQ)EBC4738755
035   $a(DE-B1597)468027
035   $a(OCoLC)979580919
035   $a(DE-B1597)9781400882618
035   $a(EXLCZ)993710000000631316
100   $a20190708d2016      fg              
101 0 $aeng
135   $aurcnu||||||||
181   $2rdacontent
182   $2rdamedia
183   $2rdacarrier
200 00$aAutomata Studies. (AM-34), Volume 34 /$fJ. McCarthy, C. E. Shannon
210  1$aPrinceton, NJ : $cPrinceton University Press, $d[2016]
210  4$dİ1956
215   $a1 online resource (297 pages) $cillustrations
225 0 $aAnnals of Mathematics Studies ;$v322
311   $a0-691-07916-1 
320   $aIncludes bibliographies.
327   $tFrontmatter -- $tPreface -- $tContents -- $tFinite Automata -- $tRepresentation of Events in Nerve Nets and Finite Automata / $rKleene, S. C. -- $tProbabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components / $rNeumann, J. von -- $tSome Uneconomical Robots / $rCulbertson, James T. -- $tSome Universal Elements for Finite Automata / $rMinsky, M. L. -- $tGedanken-Experiments on Sequential Machines / $rMoore, Edward F. -- $tTuring Machines -- $tA Universal Turing Machine with Two Internal States / $rShannon, Claude E. -- $tA Note on Universal Turing Machines / $rDavis, M. D. -- $tThe Inversion of Functions Defined by Turing Machines / $rMcCarthy, John -- $tComputability by Probabilistic Machines / $rLeeuw, K. de / Moore, E. F. / Shannon, C. E. / Shapiro, N. -- $tSynthesis of Automata -- $tDesign for an Intelligence-Amplifier / $rAshby, W. Ross -- $tThe Epistemological Problem for Automata / $rMacKay, D. M. -- $tConditional Probability Machines and Conditioned Reflexes / $rUttley, Albert M. -- $tTemporal and Spatial Patterns in a Conditional Probability Machine / $rUttley, Albert M. 
330   $aThe description for this book, Automata Studies. (AM-34), Volume 34, will be forthcoming.
410  0$aAnnals of mathematics studies ;$vno. 34.
606   $aMachine theory
606   $aConscious automata
610   $aA Mathematical Theory of Communication.
610   $aAbstraction (software engineering).
610   $aAccuracy and precision.
610   $aAlgebraic theory.
610   $aArithmetic.
610   $aAutomaton.
610   $aAxiom.
610   $aBinary number.
610   $aBiophysics.
610   $aBit.
610   $aBoolean algebra (structure).
610   $aCalculation.
610   $aChaos theory.
610   $aCircuit design.
610   $aClassical conditioning.
610   $aCombination lock.
610   $aCombination.
610   $aComputable number.
610   $aComputation.
610   $aConcepts (C++).
610   $aConditional probability.
610   $aConnectivity (graph theory).
610   $aCorrelation and dependence.
610   $aCounterexample.
610   $aCounting.
610   $aDecision problem.
610   $aDescription number.
610   $aDetection.
610   $aDeterminism.
610   $aDeterministic system (philosophy).
610   $aDiagram (category theory).
610   $aDiagram.
610   $aEntscheidungsproblem.
610   $aEnumeration.
610   $aEquation.
610   $aEstimation.
610   $aExponentiation.
610   $aFinite-state machine.
610   $aFirst principle.
610   $aFixed point (mathematics).
610   $aFunction (mathematics).
610   $aGödel numbering.
610   $aHardware random number generator.
610   $aHeuristic argument.
610   $aInstance (computer science).
610   $aInterlacing (bitmaps).
610   $aIntuitionistic logic.
610   $aLebesgue measure.
610   $aLogarithm.
610   $aLogic.
610   $aLogical disjunction.
610   $aMarkov chain.
610   $aMathematical analysis.
610   $aMathematical induction.
610   $aMathematical logic.
610   $aMathematical notation.
610   $aMathematical theory.
610   $aMathematics.
610   $aMeasure (mathematics).
610   $aMetamathematics.
610   $aModular arithmetic.
610   $aMoment (mathematics).
610   $aMoore machine.
610   $aNotation.
610   $aNumber theory.
610   $aOR gate.
610   $aParameter (computer programming).
610   $aParity (mathematics).
610   $aPermutation.
610   $aPilot plant.
610   $aPolynomial.
610   $aPrimitive recursive function.
610   $aProbability measure.
610   $aProbability.
610   $aProportionality (mathematics).
610   $aPropositional function.
610   $aQuantity.
610   $aRecursion (computer science).
610   $aRecursive set.
610   $aRecursively enumerable set.
610   $aResult.
610   $aSchematic.
610   $aSequence.
610   $aSeries (mathematics).
610   $aSet theory.
610   $aSheffer stroke.
610   $aSign (mathematics).
610   $aSolver.
610   $aSpecial case.
610   $aStochastic process.
610   $aString (computer science).
610   $aSubsequence.
610   $aSubset.
610   $aTheorem.
610   $aThermodynamic equilibrium.
610   $aTrial and error.
610   $aTuring machine.
610   $aTypewriter.
610   $aUniversal Turing machine.
610   $aVariable (mathematics).
615  0$aMachine theory.
615  0$aConscious automata.
676   $a621.38
676   $a621.34*
702   $aMcCarthy$b J., 
702   $aShannon$b C. E., 
801  0$bDE-B1597
801  1$bDE-B1597
906   $aBOOK
912   $a9910154745703321
996   $aAutomata Studies. (AM-34), Volume 34$92788525
997   $aUNINA