Search
Feedback
About UniCat 
Help
News
| Listing 1 - 10 of 232 | << page >> |
Sort by
|
ISBN: 0387197729 3540197729 1447120035 Year: 1992 Publisher: London Springer
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Neural networks (Computer science) --- Réseaux neuronaux (Informatique) --- Congresses --- Congrès --- -681.3*F11 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Réseaux neuronaux (Informatique) --- Congrès --- 681.3*F11
Book
ISBN: 0131654497 9780131654495 Year: 1972 Publisher: Londres: Prentice Hall,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Computer science --- complexe analyse (wiskunde) --- Machine theory --- #TCPW P3.0 --- 681.3*F11 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}
Book
ISBN: 047108848X 9780471088486 Year: 1967 Publisher: New York (N.Y.): Wiley
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Computer science --- 681.3*F11 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}
Dissertation
ISBN: 9056825194 Year: 2004 Publisher: Leuven Katholieke Universiteit Leuven. Faculteit der Toegepaste Wetenschappen
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
681.3*F11 <043> --- Academic collection --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Theses --- 681.3*F11 <043> Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties
Book
ISBN: 9061962560 Year: 1983 Volume: 160 Publisher: Amsterdam Mathematisch centrum
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
AUTOMATH (Formal language) --- AUTOMATH (Langage formel) --- 681.3*F11 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}
Book
ISBN: 0471631434 9780471631439 Year: 1968 Publisher: New York (N.Y.): Wiley
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Machine theory. --- Machine theory --- #TCPW P3.0 --- 681.3*F11 --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}
Book
ISBN: 9071694291 Year: 1997 Publisher: Den Haag Ten Hagen
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
#TELE:SISTA --- 681.3*F11 --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Artificial intelligence. Robotics. Simulation. Graphics
ISBN: 0124208509 9780124208506 Year: 1974 Publisher: New York, NY : Academic Press,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Discrete mathematics --- Electronic digital computers --- Computer science --- Programmation des ordinateurs --- Informatique --- Programming --- Mathematics --- Mathématiques --- Computer programming --- Data processing --- -Computer programming --- 681.3*F11 --- 681.3*F41 --- Computers --- Electronic computer programming --- Electronic data processing --- Programming (Electronic computers) --- Coding theory --- Math --- Science --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computer programming. --- Data processing. --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematics - Data processing --- Mathématiques
Book
ISBN: 0198531885 9780198531883 Year: 1982 Publisher: Oxford Clarendon
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
510.5 --- 511 --- 681.3*F11 --- 681.3*F41 --- Algorithms. Computable functions --- Number theory --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 511 Number theory --- 510.5 Algorithms. Computable functions --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23}
Book
ISBN: 3540137211 0387137211 3642699677 3642699650 9780387137216 9783540137214 Year: 1987 Volume: 9 Publisher: Berlin Springer-Verlag
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
681.3*F11 --- 681.3*F41 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic, Symbolic and mathematical --- Logique mathématique --- Constructive mathematics --- Mathématiques constructives --- Logic, Symbolic and mathematical. --- Logique mathématique. --- Constructive mathematics. --- Mathématiques constructives. --- Logique mathématique --- Récursivité, Théorie de la --- Computational Complexity --- Recursion --- Analysis --- Computability --- Recursive Function --- Flowchart --- Logique mathematique --- Calculabilite --- Computer science
| Listing 1 - 10 of 232 | << page >> |
Sort by
|