{\rtf1\ansi\deff1
{\fonttbl{\f0\froman\fprq2\fcharset0 Times;}{\f1\froman\fprq2\fcharset0 Times New Roman;}{\f2\fswiss\fprq2\fcharset0 Arial;}{\f3\fmodern\fprq1\fcharset0 Courier New;}{\f4\froman\fprq2\fcharset2 Symbol;}{\f5\fnil\fprq2\fcharset2 Wingdings;}{\f6\froman\fprq2\fcharset0 Times;}{\f7\fswiss\fprq2\fcharset238 Arial CE;}{\f8\froman\fprq2\fcharset0 Times New Roman;}{\f9\froman\fprq2\fcharset238 Times New Roman CE;}}
{\colortbl\red0\green0\blue0;\red0\green0\blue255;\red128\green0\blue128;\red0\green0\blue128;\red255\green255\blue255;\red128\green128\blue128;}
{\stylesheet{\s1\snext1 Standard;}
{\s2\fs20\lang1038\sbasedon1\snext2 Normal;}
{\s3\ls2\ilvl0\outlinelevel0\keepn\fs32\lang1033\qc\sbasedon2\snext2{\*\soutlvl0} heading 1;}
{\s4\ls2\ilvl1\outlinelevel1\keepn\fs20\lang1038\i\qc\sbasedon2\snext2{\*\soutlvl1} heading 2;}
{\s5\sb240\sa60\keepn\f2\fs26\lang1038\b\sbasedon2\snext2 heading 3;}
{\s6\f3\fs20\lang1038\sbasedon2\snext6 Plain Text;}
{\s7\fs32\lang1033\qc\sbasedon2\snext7 Title;}
{\s8\fs20\lang1038\qj\sbasedon2\snext8 Body Text;}
{\s9\tqc\tx4320\tqr\tx8640\sbasedon1\snext9 Header;}
{\s10\tqc\tx4320\tqr\tx8640\sbasedon1\snext10 Footer;}
{\s11\sa120\sbasedon1\snext11 Text body;}
{\s12\sa120\sbasedon11\snext12 Table Contents;}
{\s13\sa120\i\b\qc\sbasedon12\snext13 Table Heading;}
{\s14\li0\ri0\fi283\sa120\sbasedon11\snext14 First line indent;}
{\s15\sb240\sa283\keepn\fs28\sbasedon1\snext11 Heading;}
{\s16\sb240\sa283\keepn\fs36\b\sbasedon15\snext11 Heading 2;}
{\*\cs18\f4 RTF_Num 2 1;}
{\*\cs19\f3 RTF_Num 2 2;}
{\*\cs20\f5 RTF_Num 2 3;}
{\*\cs21\f4 RTF_Num 2 4;}
{\*\cs22\f3 RTF_Num 2 5;}
{\*\cs23\f5 RTF_Num 2 6;}
{\*\cs24\f4 RTF_Num 2 7;}
{\*\cs25\f3 RTF_Num 2 8;}
{\*\cs26\f5 RTF_Num 2 9;}
{\*\cs27\f4 RTF_Num 3 1;}
{\*\cs28\f3 RTF_Num 3 2;}
{\*\cs29\f5 RTF_Num 3 3;}
{\*\cs30\f4 RTF_Num 3 4;}
{\*\cs31\f3 RTF_Num 3 5;}
{\*\cs32\f5 RTF_Num 3 6;}
{\*\cs33\f4 RTF_Num 3 7;}
{\*\cs34\f3 RTF_Num 3 8;}
{\*\cs35\f5 RTF_Num 3 9;}
{\*\cs36\f4 RTF_Num 5 1;}
{\*\cs37\f3 RTF_Num 5 2;}
{\*\cs38\f5 RTF_Num 5 3;}
{\*\cs39\f4 RTF_Num 5 4;}
{\*\cs40\f3 RTF_Num 5 5;}
{\*\cs41\f5 RTF_Num 5 6;}
{\*\cs42\f4 RTF_Num 5 7;}
{\*\cs43\f3 RTF_Num 5 8;}
{\*\cs44\f5 RTF_Num 5 9;}
{\*\cs45\fs24\lang1033\sbasedon46 Default Paragraph Font;}
{\*\cs46\fs20\lang1038 Normal;}
{\*\cs47\cf1\ul\sbasedon45 Hyperlink;}
{\*\cs48\cf2\ul\sbasedon45 FollowedHyperlink;}
{\*\cs49\cf3\ul Internet link;}
}{\*\listtable{\list\listtemplateid1
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}{\listname RTF_Num 5;}\listid1}
{\list\listtemplateid2
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'b7;}{\levelnumbers;}\f4\f4\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'6f;}{\levelnumbers;}\f3\f3\fi0\li0}
{\listlevel\levelnfc23\leveljc0\levelstartat1\levelfollow2{\leveltext \'01\'a7;}{\levelnumbers;}\f5\f5\fi0\li0}{\listname RTF_Num 2;}\listid2}
}{\listoverridetable{\listoverride\listid1\listoverridecount0\ls1}{\listoverride\listid2\listoverridecount0\ls0}}

{\info{\comment StarWriter}{\vern5690}}\deftab708
{\*\pgdsctbl
{\pgdsc0\pgdscuse195\pgwsxn12240\pghsxn15840\marglsxn1320\margrsxn1320\margtsxn1417\margbsxn1417\pgdscnxt0 Standard;}
{\pgdsc1\pgdscuse195\pgwsxn12240\pghsxn15840\marglsxn1320\margrsxn1320\margtsxn720\margbsxn720\headery0{\*\headeryb0\headerxl0\headerxr0\headeryh697}{\header \pard\plain \s9\tqc\tx4320\tqr\tx8640\tqc\tx4320\tqr\tx8640 
\par }
\footery0{\*\footeryt0\footerxl0\footerxr0\footeryh697}{\footer \pard\plain \s10\tqc\tx4320\tqr\tx8640\tqc\tx4320\tqr\tx8640 
\par }
\pgdscnxt1 RTF-SectionPage(1);}}
{\*\pgdscno1}\paperh15840\paperw12240\margl1320\margr1320\margt720\margb720\sectd\sbknone\pgwsxn12240\pghsxn15840\marglsxn1320\margrsxn1320\margtsxn1417\margbsxn989\headery720{\header \pard\plain \s9\tqc\tx4320\tqr\tx8640\tqc\tx4320\tqr\tx8640 
\par }
\footery720{\footer \pard\plain \s10\tqc\tx4320\tqr\tx8640\tqc\tx4320\tqr\tx8640 
\par }
\ftnbj\ftnstart1\ftnrstcont\ftnnar\aenddoc\aftnrstcont\aftnstart1\aftnnrlc
\pard\plain {\listtext\pard\plain \keepn\f6\fs32\qc }\s3\ls2\ilvl0\outlinelevel0\keepn\fs32\lang1033\qc\li0\ri0\fi0\f6 Neuronh{\lang1038 \'e1}l\'f3zatok struktur\'e1lis k\'e9rd\'e9sei
\par \pard\plain \s8\fs20\lang1038\qj\f6\fs24 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f6\fs24\qj Az \'f6sszej\'f6vetel eredeti {\b c\'e9lja:} \'e1ttekinteni azokat az algebrai, kombinatorikai, logikai, nyelv\'e9szeti \'e9s egy\'e9b eszk\'f6z\'f6ket, amelyeket neuronh\'e1l\'f3zatok vizsg\'e1lat\'e1ra szok\'e1s alkalmazni. Legkev\'e9sb\'e9 a hagyom\'e1nyos, diszkr\'e9t illetve folytonos idej\'fb dinamikai rendszer
ekkel val\'f3 le\'edr\'e1sr\'f3l lesz sz\'f3. Szervez\'e9s k\'f6zben viszont m\'e1r csak arra koncentr\'e1ltunk, hogy olyan el\'f5ad\'f3kat k\'e9rj\'fcnk fel, akikt\'f5l (m\'e9g ha t\'e9m\'e1juk a fentiekhez laz\'e1n kapcsol\'f3dik is) sokat tanulhatunk, \'e9s ezt m\'e9g \'e9lvezz\'fck is.
\par \pard\plain \s6\f3\fs20\lang1038\f6\fs24 
\par \pard\plain \s8\fs20\lang1038\qj\f6\fs24 Az \'f6sszej\'f6vetel {\b helysz\'edne:} MTA KFKI (Csilleb\'e9rc) III. \'c9p\'fclet, tan\'e1csterem. Hogyan lehet oda eljutni? Akinek aut\'f3ja van, t\'e9rk\'e9pe is van, sz\'f3ljunk ez\'e9rt a gyalogosokhoz. 
\par Van egy k\'fcl\'f6n KFKI busz 8.30-kor reggel, a Moszkva t\'e9rr\'f5l. Ha megtal\'e1lj\'e1k a 21-es buszok indul\'e1si hely\'e9t a Moszkva t\'e9ren, att\'f3l lefel\'e9 egy picit tal\'e1lhat\'f3 a KFKI-s buszok indul\'e1si helye. A KFKI-s buszok sarg\'e1k, \'e9s jegyet sem kell venni r\'e1juk, nem \'e1llnak me
g sehol, csak a KFKI el\'f6tt. A 8.30-as busz 9-re \'e9r fel a KFKI-ba. A m\'e1sik lehet\'f5s\'e9g, hogy 
\par a Moszkva t\'e9ren (esetleg a D\'e9li p\'e1lyaudvarn\'e1l) a {\b fekete} (nem piros) 21-es buszra f\'f6lsz\'e1llva elmegy\'fcnk annak a v\'e9g\'e1llom\'e1s\'e1ig, majd ott \'e1tsz\'e1llunk a 90-es buszra. Annak a v\'e9g\'e1llom\'e1s\'e1n\'e1l van a KFKI telephelye. A kapu\'f5r\'f6k sz\'e9p hagyom\'e1nyaikhoz h\'edven most is ala
posan meg fogj\'e1k vizsg\'e1lni szem\'e9lyi igazolv\'e1nyunkat, de az\'e9rt be fognak engedni. \'c1lland\'f3, illetve a szervez\'f5k \'e1ltal kitett ideiglenes t\'e1bl\'e1k fogj\'e1k mutatni az utat a III. \'e9p\'fclet fel\'e9.
\par 
\par Ha az el\'f5ad\'f3k k\'f6z\'fcl valakinek valamilyen eszk\'f6zre vagy programra sz\'fcks\'e9ges van, sz\'f3ljon. Ha a vid\'e9ki el\'f5ad\'f3k hoznak sz\'e1ml\'e1t (MTA KFKI RMKI Biofizikai Oszt\'e1ly, Budapest, 1121 Konkoly Thege Miklos ut 29-33), akkor az \'fati k\'f6lts\'e9get megt\'e9r\'edtj\'fck.
\par \pard\plain \s2\fs20\lang1038\f6\fs24 
\par Az els\'f5 nap kezd\'e9si id\'f5pontja: 9 \'f3ra 15 perc.
\par 
\par **********************************************************************
\par \pard\plain \s2\fs20\lang1038\f6\fs28 
\par 
\par 
\par \pard\plain \s2\fs20\lang1038 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par 
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b\f7 J\'falius 1., h\'e9tf\'f5
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038\f6\fs24 Eln\'f6k: Somogyv\'e1ri Zolt\'e1n
\par \trowd\trql\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 09:15
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 T\'f3th J\'e1nos
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Megnyit\'f3
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 09:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Sz\'e9kely Andrea
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 A k\'f6zponti idegrendszer szerkezete: 
\par Az agyt\'f3l a szinapszisokig
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 10:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 T\'f3th J\'e1nos
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Mathematica \'e9s komput\'e1ci\'f3tudom\'e1ny
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 11:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 eb\'e9d
\par 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 12:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 L\'e1bos Elem\'e9r
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 A Sloane-enciklop\'e9di\'e1r\'f3l
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 20 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 13:00
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Bazs\'f3 F\'fcl\'f6p
\cell\pard\plain \intbl\s7\fs32\lang1033\qc\f6\fs24\qj Boole-f\'fcggv\'e9ny kalkulus \'e9s n\'e9h\'e1ny alkalmaz\'e1sa
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\qr     {\fs24  14:00}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Peth\'f5 Attila
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 K\'eds\'e9rletes sz\'e1melm\'e9let
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 90 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1577\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3155\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8146\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 15:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Besz\'e9lget\'e9s
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6 
\cell\row\pard \pard\plain \s1\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\fs24\tx4545 
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b 
\par J\'falius 2., kedd
\par \pard\plain \s6\f3\fs20\lang1038\f6\fs24 Eln\'f6k: Szaliszny\'f3 Krisztina
\par \trowd\trql\trleft15\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\qr 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr  {\f6 9:30}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 N\'e9gyessy L\'e1szl\'f3
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6{\fs24 Reverber\'e1ci\'f3, perszever\'e1ci\'f3, disztraktibilit\'e1s}: {\fs24 prefront\'e1lis k\'e9rgi neur\'e1lis h\'e1l\'f3zatok funkcionalis k\'e9rd\'e9sei}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 10:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 Pal\'e1ncz B\'e9la
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\qj Szimbolikus neur\'e1lis h\'e1l\'f3zati sz\'e1m\'edt\'e1sok
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 30 perc
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr 
\par  {\f6 11:30}
\par 
\par 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 Somogyv\'e1ri Zolt\'e1n
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033\qj 
\par V\'e9letlen Boole-h\'e1l\'f3zatok dinamik\'e1ja
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 
\par 45 perc
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr 
\par  {\f6 12:30}
\par  
\cell\pard\plain \intbl\s6\f3\fs20\lang1038 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 eb\'e9d
\cell\pard\plain \intbl\s7\fs32\lang1033\qc\fs24\qj 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qj 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr 
\par  {\f6 13:30}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 
\par R\'f3nyai Lajos
\cell\pard\plain \intbl\s7\fs32\lang1033\qc\fs24\qj Keres\'e9s, sz\'f6vegek, Internet, algebra, algoritmusok
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\qj 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24{\f9  }{\f1 90 perc}
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 
\par                   
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 15:00
\par \pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr  
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 Prosz\'e9ky G\'e1bor
\cell\pard\plain \intbl\s1\f6 D\'f6nt\'e9si helyzetek a nyelvfeldolgoz\'e1sban
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\lang1033 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24{\f6 60 perc}
\cell\row\pard \trowd\trql\trleft15\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1498\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3575\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8145\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr  {\f6 16:00}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\lang1033 Besz\'e9lget\'e9s
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\row\pard \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b J\'falius 3., szerda
\par \pard\plain \s6\f3\fs20\lang1038\f6\fs24 Eln\'f6k: Zal\'e1nyi L\'e1szl\'f3 
\par \trowd\trql\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1492\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrt\brdrs\brdrw1\brdrcf0\brsp0\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 09:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 L\'f3czi Lajos
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033 Stephen Wolfram: {\i A New Kind of Science}
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 10:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 Csuhaj Varj\'fa Erzs\'e9bet
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033\qj Nyelvprocesszor-h\'e1l\'f3zatok: biol\'f3giai ind\'edttat\'e1s\'fa kisz\'e1m\'edt\'e1si modellek
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24  
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr        
\par        11:30
\par 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 eb\'e9d
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033\qj 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24 
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clvertalb\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 12:30
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24 K\'e1lm\'e1n L\'e1szl\'f3
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033\qj Nyelvi k\'e9pess\'e9gek: Alakfelismer\'e9s vagy szimb\'f3lumgener\'e1l\'e1s?
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24         60 perc
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr    {\f6 13:30}
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr  
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 \'c9rdi P\'e9ter
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\lang1033\qj Egy divat hordal\'e9ka: Kis-vil\'e1g szerkezete van-e az emberi nyelvnek?
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\fs24  {\f6       60 perc}
\cell\row\pard \trowd\trql\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx1492\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx3849\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\cellx8147\clbrdrl\brdrs\brdrw1\brdrcf0\brsp0\clbrdrb\brdrs\brdrw1\brdrcf0\brsp0\clbrdrr\brdrs\brdrw1\brdrcf0\brsp0\cellx9600
\pard\intbl\pard\plain \intbl\s6\f3\fs20\lang1038\fs24\qr    {\f6 14:30}     
\par \pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24\qr 
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24 Szaliszny\'f3 Kriszta
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f1\fs24\qj Szimbolikus dinamika \'e9s form\'e1lis nyelvek
\cell\pard\plain \intbl\s6\f3\fs20\lang1038\f6\fs24          20 perc
\cell\row\pard \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b\f7 
\par 
\par Az el\'f5ad\'e1sok szerz\'f5inek adatai \'e9s az el\'f5ad\'e1sok magyar nyelv\'fb kivonata
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc 
\par Boole-f\'fcggv\'e9ny kalkulus \'e9s n\'e9h\'e1ny alkalmaz\'e1sa
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc Bazs\'f3 F\'fcl\'f6p
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI Biofizikai Oszt\'e1ly 
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par bazso@sunserv.kfki.hu
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj Boole-f\'fcggv\'e9nyek iter\'e1l\'e1s\'e1val fenomenol\'f3giai dinamikus modelleket alkothatunk neur\'e1lis \'e9s egy\'e9bb h\'e1l\'f3zatokr\'f3l \'e9s k\'e9pet alkothatunk a h\'e1l\'f3zaton \'e9rtelmezett dinamika tulajdons\'e1gair\'f3l. Megmutatjuk, hogy az \'edgy \'e9rtelmezett dinamikai rendszerekben megkonstru\'e1lh
at\'f3k a folytonos dinamik\'e1ban haszn\'e1lt fogalmak \'e9s eszk\'f6z\'f6k megfelel\'f4i. P\'e9ld\'e1kon szeml\'e9ltet\'fcnk n\'e9h\'e1ny bevezetett fogalmat.
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\qc 
\par 
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\qc{\lang1033 Nyelvprocesszor-h\'e1l\'f3zatok: biol\'f3giai }ind\'edttat\'e1s\'fa{\lang1033  kisz\'e1m\'edt\'e1si modellek}
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc Csuhaj Varj\'fa Erzs\'e9bet
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA SZTAKI 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc H-1111 Budapest, Kende u.13-17.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:csuhaj@sztaki.hu" }{\fldrslt \*\cs49\cf3\ul csuhaj@sztaki.hu}}}
\par \pard\plain \s6\f3\fs20\lang1038\i\qc 
\par \pard\plain \s6\f3\fs20\lang1038\fs24\qj 
\par \pard\plain \s6\f3\fs20\lang1038\qj{\f1 A nyelvprocesszor-h\'e1l}{\f9 \'f3zatok olyan, a hagyom\'e1nyost\'f3l elt\'e9r\'f5 kisz\'e1m\'edt\'e1si eszk\'f6z\'f6k, amelyek dinamikusan v\'e1ltoz\'f3 \'e1llapot\'fa, egym\'e1ssal kommunik\'e1l\'f3 \'e1gensek k\'f6z\'f6ss\'e9gei viselked\'e9s\'e9nek form\'e1lis nyelvi eszk\'f6z\'f6kkel val\'f3 le\'edr\'e1s\'e1ra szolg\'e1lnak. }
\par 
\par {\f1 A nyelvprocesszor h\'e1l\'f3zat egy virtu\'e1lis gr\'e1f,}{\f9  amelynek cs\'facsaiban nyelvprocesszorok (grammatik\'e1k, automat\'e1k vagy egy\'e9b nyelvle\'edr\'f3 eszk\'f6z\'f6k), valamint szavak halmazai, illetve multihalmazai helyezkednek el. A h\'e1l\'f3zat m\'fbk\'f6d\'e9se sor\'e1n a nyelvprocesszorok egym\'e1
ssal szinkroniz\'e1lt m\'f3don \'fajra\'edrj\'e1k a rendelkez\'e9s\'fckre \'e1ll\'f3 szavakat, majd a h\'e1l\'f3zat kommunik\'e1ci\'f3s protokollj\'e1nak megfelel\'f5en az \'edgy nyert bet\'fbsorozatokat, illetve azok m\'e1solatait k\'f6zvet\'edtik a m\'e1s cs\'facsokban elhelyezked\'f5 nyelvprocesszorokhoz. A szavak \'e1t\'edr\'e1s
\'e1nak \'e9s kommunik\'e1ci\'f3j\'e1nak mint elemi l\'e9p\'e9seknek a sorozata egy kisz\'e1m\'edt\'e1si sorozat. A kisz\'e1m\'edt\'e1s eredm\'e9nyek\'e9nt tekinthetj\'fck pl. az egy bizonyos cs\'facsban a kisz\'e1m\'edt\'e1si l\'e9p\'e9sek sor\'e1n vagy egy bizonyos l\'e9p\'e9s sor\'e1n fellelhet\'f5 szavak halmaz\'e1t, illetve multihalm
az\'e1t.}
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj A nyelvprocesszor-h\'e1l\'f3zatok nemcsak hagyom\'e1nyos kisz\'e1m\'edt\'e1si (nyelvdefini\'e1l\'f3) eszk\'f6z\'f6k, hanem olyan k\'e9rd\'e9sek tanulm\'e1nyoz\'e1s\'e1ra is alkalmas modellek, mint pl. a szavakb\'f3l \'e1ll\'f3 multihalmazok dinamik\'e1j\'e1nak le\'edr\'e1sa. Ha a szavakat egyedekk\'e9nt, DNS sorozatokat, va
gy egy\'e9b biol\'f3giai tulajdons\'e1gokat meghat\'e1roz\'f3 k\'f3dokk\'e9nt tekintj\'fck, ezen eszk\'f6z\'f6k seg\'edts\'e9g\'e9vel bizonyos felt\'e9telek mellett v\'e1ltoz\'f3 \'e9s egym\'e1ssal k\'f6lcs\'f6nhat\'e1sban \'e1ll\'f3  popul\'e1ci\'f3k dinamik\'e1j\'e1t is jellemezhetj\'fck.
\par  
\par \pard\plain \s6\f3\fs20\lang1038\qj{\f9 Az el\'f5ad\'e1sban a nyelvprocesszor-h\'e1l\'f3zatok k\'e9t fajt\'e1j\'e1nak bemutat\'e1s\'e1val  illusztr\'e1ljuk az el\'f5bb mondottakat. Az els\'f5 h\'e1l\'f3zat t\'edpust az \'fan. Lindenmayer-rendszerek h\'e1l\'f3zatai alkotj\'e1k, amelyek  fejl\'f5d\'f5 rendszerek le\'edr\'e1s\'e1ra szolg\'e1l\'f3, p\'e1rhuzamos \'e1t\'edr\'e1st alkalmaz
\'f3 grammatik\'e1k h\'e1l\'f3zatai. A m\'e1sodik h\'e1l\'f3zat t\'edpus az \'fan. Watson-Crick Lindenmayer rendszerek h\'e1l\'f3zata, ahol a fejl\'f5d\'e9s megjelen\'edt\'e9s\'e9re szolg\'e1l\'f3 p\'e1rhuzamos \'fajra\'edr\'e1st egy, a DNS kisz\'e1m\'edt\'e1sb\'f3l ismeretes alapvet\'f5 tulajdons\'e1g, az \'fan. Watson-Crick komplementarit\'e1}
{\f1 s elve kontroll\'e1lja.}
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f9\qj Bemutatjuk, hogy ezen h\'e1l\'f3zatok nagyon egyszer\'fb nyelvprocesszorok \'e9s kommunik\'e1ci\'f3s protokollok eset\'e9n is nagy hat\'e9konys\'e1g\'fa kisz\'e1m\'edt\'e1si eszk\'f6z\'f6k (a Turing-g\'e9pekkel egyenl\'f5 erej\'fbek), valamint seg\'edts\'e9g\'fckkel \endash  a rendk\'edv\'fcli p\'e1rhuzamoss\'e1g miatt \endash  NP-teljes probl
\'e9m\'e1k is line\'e1ris id\'f5ben megoldhat\'f3k. Ugyancsak megmutatjuk, hogyan lehet ezen h\'e1l\'f3zatok eset\'e9ben a cs\'facsokban elhelyezked\'f5 szavakb\'f3l \'e1ll\'f3 multihalmazok dinamik\'e1j\'e1t le\'edrni.
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b Irodalom:
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls1{\f1 E. Csuhaj-Varj\'fa: Networks of Language Processors. E}{\f9 ATCS Bulletin 63 (1997), 120-134. Appears also in  Gh. P\'e3un, G.Rozenberg, A.Salomaa (eds.) Current Trends in Theoretical Computer Science, World Scientific, Singapore, 2001, 771-790.}
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls1{\f1 E. Csuhaj-Varj\'fa and A. Salomaa, Networks of parallel language processors.}{\f9  In: New Trends in Computer Science, Cooperation, Control, Combinatorics. (Gh. P\'e3un and  A. Salomaa, eds.), LNCS 1218, Springer-Verlag, Berlin-Heidelberg-New York, 1997, 299-318.}
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 E. Csuhaj-Varj\'fa and A. Salomaa, Networks of Watson-Crick D0L systems. TUCS Report 419, Turku Centre for Computer Science, Turku, 2001. To appear in Proc. Third International Conference on Words, Languages, and Combinatorics, Kyoto, 2000. (M. Ito, ed.), Wor
ld Scientific, Singapore, 2002.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls1{\f9 G. P\'e3un, G. Rozenberg and A. Salomaa, DNA Com}{\f1 puting. New Computing Paradigms. Springer-Verlag, Berlin, Heidelberg, New York (1998).}
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Handbook of Formal Languages, Vol. I-III. (G. Rozenberg and  A. Salomaa, eds.) Springer Verlag, Berlin, Heidelberg, New York, 1997.
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc 
\par 
\par 
\par 
\par 
\par 
\par 
\par Egy divat hordal\'e9ka: Kis-vil\'e1g szerkezete van-e az emberi nyelvnek?
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc \'c9rdi P\'e9ter 
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc Kalamazoo College \'e9s MTA KFKI RMKI Biofizikai Oszt\'e1ly
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI Biofizikai Oszt\'e1ly 
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:perdi@kzoo.edu" }{\fldrslt \*\cs49\cf3\ul perdi@kzoo.edu}}}
\par 
\par \pard\plain \s6\f3\fs20\lang1038 
\par 
\par 
\par \pard\plain \s1\fs20\qj{\f6 Egy divat hordal\'e9ka: Kis-vil\'e1g szerkezete van-e az emberi nyelvnek? Erd\'f4s P\'e1l \'e9s R\'e9nyi Alfr\'e9d egy igen h\'edres t\'e9tel\'e9nek k\'f6vetkezm\'e9nye szerint a sok csom\'f3pontb\'f3l \'e1ll\'f3 v\'e9letlen h\'e1l\'f3zatokban (gr\'e1fokban) k\'e9t v\'e9letlen\'fcl kiv\'e1lasztott csom\'f3pont k\'f6z\'f6tt a t\'e1vols\'e1g, 
azaz az \'f6sszek\'f6ttet\'e9st biztos\'edt\'f3 \'e9lek sz\'e1ma, nagy val\'f3sz\'edn\'fbs\'e9ggel el\'e9g kicsi. Bizonyos szab\'e1lyos szerkezetekben ez a t\'e1vols\'e1g nagy. A term\'e9szetes h\'e1l\'f3zatok  feltehet\'f4leg \'e1ltal\'e1ban \'e1tmenetet k\'e9peznek a teljesen v\'e9letlen \'e9s a teljesen  szab\'e1lyos szerkezetek 
k\'f6z\'f6tt. Ezekre az jellemz\'f5, hogy az \'e1tlagos t\'e1vols\'e1g kicis\'e9ge mellett a klaszterez\'f5d\'e9si m\'e9rt\'e9k sokkal nagyobb, mint a megfelel\'f5 nagys\'e1g\'fa v\'e9letlen gr\'e1fokban. Ezek a kis-vil\'e1g gr\'e1fok (Watts 1999.) Enn\'e9l t\'f6bb is igaz. Minthogy nem minden csom\'f3ponthoz tartozik
 ugyanannyi \'e9l, az \'e9lek csom\'f3pontokon val\'f3 eloszl\'e1sa jellemzi a h\'e1l\'f3zat szerkezet\'e9t. A term\'e9szetes h\'e1l\'f3zatok gyakran hatv\'e1nyeloszl\'e1ssal  \'edrhat\'f3k le ("scale-free distribution"). }Ramon Ferrer i Cancho \'e9s Ricard V. Sole (2001) szerint az emberi nyelv szerkeze
t\'e9re is jellemz\'f5 a kisvil\'e1g gr\'e1f.  Az persze r\'e9g\'f3ta ismert, hogy a szavak gyakoris\'e1ga \'e9s rangja (n) k\'f6zti \'f6sszef\'fcgg\'e9st 1/n alak\'fa eloszl\'e1s \'edrja le (Zipf 1949, l\'e1sd m\'e9g pl. Kornai 1999). B\'e1r az el\'f5ad\'f3 elmondja, mi van nagyj\'e1b\'f3l a Cancho \'e9s Sole cikkben, szer
etn\'e9 a nyelv\'e9szekt\'f5l megk\'e9rdezni, a nyelv\'e9szekt\'f5l, nincs-e az eg\'e9sz konstrukci\'f3 teljes ellent\'e9tben a felszini \'e9s m\'e9lystrukt\'far\'e1kr\'f3l (m\'e1sok \'e1ltal ismertekr\'f5l (Chomsky 1957)?
\par \pard\plain \s1\fs20 
\par \pard\plain \s1\fs20\b Irodalom:
\par \pard\plain \s1\fs20 
\par Albert R and  Barab\'e1si AL: Statistical mechanics of complex networks.
\par Reviews of Modern Physics 74, 47, 2002.
\par 
\par Chomsky N.: Syntactic structures. Mouton 1957.
\par 
\par \pard\plain \s1\f6\fs20 Erd\'f5s, P., and  R\'e9nyi A.:  On the evolution of random graphs. Publications
\par of the Mathematical Institute of the Hungarian Academy of Sciences 5:17-6,
\par 196\'f6.
\par 
\par Ramon Ferrer i Cancho  and Ricard V. Sole: The small world of human
\par language Proc. R. Soc. Lond. B  2261-2265;(2001),
\par 
\par Kornai A: Zipf's law outside the middle range Proc. Sixth Meeting on
\par Mathematics of Language University of Central Florida, 347-356, 1999
\par 
\par Watts, D: Small Worlds: The dynamics of Networks between Order and
\par Randomness, Princeton Univ. Press. 1999
\par 
\par Zipf, G. K:  Human behaviour and the principle of least effort. An
\par introduction to human ecology. Cambridge, MA: Addison-Wesley, 1949.
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f6 
\par 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc Nyelvi k\'e9pess\'e9gek: Alakfelismer\'e9s vagy szimb\'f3lumgener\'e1l\'e1s?
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc K\'e1lm\'e1n L\'e1szl\'f3 
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://budling.nytud.hu/~kalman" }{\fldrslt \*\cs49\cf3\ul http://budling.nytud.hu/~kalman}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc Mindmaker Kft.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:kalman@mindmaker.hu" }{\fldrslt \*\cs49\cf3\ul kalman@mindmaker.hu}}}
\par 
\par \pard\plain \s6\f3\fs20\lang1038 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\qj{\f9 A term\'e9szetes nyelvek Chomsky-f\'e9le form\'e1lis nyelvi modelljeinek alapvet\'f5 feltev\'e9se, hogy a nyelvi tud\'e1sban k\'e9t komponenst k\'fcl\'f6n\'edthet\'fcnk el:  egy kombinatorikus rendszert (a szintaxist) \'e9s a kiindul\'f3 \'e9p\'edt\'f5elemekr\'f5l sz\'f3l\'f3 tud\'e1st (a lexikont).  A poszt-chomsk
y\'e1nus (konstrukci\'f3s) nyelvtanfelfog\'e1s ezzel szemben azt \'e1ll\'edtja, hogy a szavakat \'e9s a mondattani szerkezeteket (meg a sokf\'e9le k\'f6zbees\'f5 dolgot) egy\'f6ntet\'fben kell kezelni, mindezeknek egyszerre vannak formai \'e9s jelent\'e9stani jellemz\'f5i:  a konstrukci\'f3k a forma }
{\f1 \'e9s a jelent\'e9s \'f6sszekapcsol\'e1s\'e1t val\'f3s\'edtj\'e1k meg.}
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj 
\par \pard\plain \s6\f3\fs20\lang1038\qj{\f9 Eszerint a kommunik\'e1ci\'f3ban nem lexikai \'e9p\'edt\'f5k\'f6vekb\'f5l kombinatorikus m\'f3don \'f6ssze\'e1ll\'edtott line\'e1risan rendezett sorozatokat haszn\'e1lunk, hanem k\'fcl\'f6nb\'f6z\'f5 szempontok egyidej\'fb \'e9rv\'e9nyes\'fcl\'e9s\'e9t kifejez\'f5 mint\'e1zatokat, k}{\f1 onstrukci\'f3kat.  }
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f9\qj A Mindmaker egy ilyen poszt-chomsky\'e1nus nyelvtant pr\'f3b\'e1l implement\'e1lni (az ,,integr\'e1lt NLP\rquote \rquote   paradigm\'e1j\'e1n bel\'fcl).  A konstrukci\'f3k asszoci\'e1ci\'f3s h\'e1l\'f3zatot alkotnak, de alapvet\'f5en szimbolikus inform\'e1ci\'f3t hordoznak \'e9s a feladat kombinatorikus jellege is megma
rad. Egyel\'f5re nem vil\'e1gos, hogy az ismert szubszimbolikus reprezent\'e1ci\'f3s \'e9s tanul\'e1si m\'f3dszerek (pl. konnekcionizmus) hogyan tudnak sz\'e1mot adni a feladat kett\'f5s jelleg\'e9r\'f5l.
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc A Sloane-enciklop\'e9di\'e1r\'f3l
\par \pard\plain \s2\fs20\lang1038\qc 
\par L\'e1bos Elem\'e9r
\par \pard\plain \s2\fs20\lang1038\i\qc Semmelweis Egyetem
\par II. Anat\'f3miai Int\'e9zet \endash  MTA EKSZ Neurobiol\'f3giai Kutat\'f3 Csoport
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:labos@ana.sote.hu" }{\fldrslt \*\cs49\cf3\ul labos@ana.sote.hu}}}
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc 
\par Stephen Wolfram: {\i A New Kind of Science}
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\i\qc 
\par \pard\plain \s2\fs20\lang1038\f9\qc K\'f6nyvismertet\'f5 el\'f5ad\'e1s
\par \pard\plain \s2\fs20\lang1038\qc L\'f3czi Lajos
\par 
\par \pard\plain \s2\fs20\lang1038\f9\i\qc Budapesti M\'fbszaki \'e9s Gazdas\'e1gtudom\'e1nyi Egyetem
\par \pard\plain \s2\fs20\lang1038\i\qc Term\'e9szettudom\'e1nyi Kar
\par Differenci\'e1legyenletek Tansz\'e9k
\par 1521 Budapest
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:lloczi@math.bme.hu" }{\fldrslt \*\cs49\cf3\ul lloczi@math.bme.hu}}}
\par 
\par \pard\plain \s2\fs20\lang1038\qj Stephen Wolfram k\'f6nyve t\'f6bb mint egy \'e9vtizedes munka ut\'e1n elk\'e9sz\'fclt. Az 1980-as \'e9vekben sejtautomat\'e1kkal v\'e9gzett k\'eds\'e9rleteire alapozva, valamint az \'e1ltala kifejlesztett {\i Mathematica} szm\'edt\'f3g\'e9{\f9 pes programnyelv seg\'edts\'e9g\'e9vel csaknem 1100 oldal el\'f5k\'e9sz\'edt\'e9s, \'e9s sz
\'e1mtalan, a legk\'fcl\'f6nf\'e9l\'e9bb tudomnyter\'fcletr\'f5l vett p\'e9lda ut\'e1n \'e9rkez\'fcnk el a k\'f6nyv k\'f6zponti mondanival\'f3j\'e1hoz: a sz\'e1m\'edt\'e1si ekvivalencia-elvhez (}{\i Principle of Computational Equivalence}), amely t\'f6bbek k\'f6z\'f6tt azt \'e1ll\'edtja, hogy egy bizonyos szinten t\'fal b\'e1rmely k\'e9t 
rendszer bonyolults\'e1ga azonos. 
\par \tab A {\i New Kind of  Science} olvasm\'e1nyosan meg\'edrt k\'f6nyv, \'e9s egyar\'e1nt sz\'f3l specialist\'e1knak, illetve laikusoknak. Az elm\'falt \'e9vsz\'e1zadok {\i egyenletei} helyett a hangs\'faly mindv\'e9gig az {\i algoritmuson }{\f9 van. \'c1lland\'f3an v\'e9gigvonul\'f3 mot\'edvum, hogy nagyon egyszer\'fb szab\'e1lyok menny
ire \'f6sszetett rendszereket k\'e9pesek l\'e9trehozni. Wolfram azt j\'f3solja, hogy szeml\'e9letm\'f3dja komoly kihat\'e1ssal lesz az eg\'e9sz tudom\'e1nyra, illetve tudom\'e1nyos gondolkod\'e1sunkra.  }
\par 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s7\fs32\lang1033\qc Reverber\'e1ci\'f3, perszever\'e1ci\'f3, disztraktibilit\'e1s: prefront\'e1lis k\'e9rgi neur\'e1lis h\'e1l\'f3zatok funkci\'f3j\'e1nak k\'e9rd\'e9sei
\par 
\par \pard\plain \s7\fs32\lang1033\qc\fs20 N\'e9gyessy L\'e1szl\'f3
\par \pard\plain \s2\fs20\lang1038\i\qc Semmelweis Egyetem
\par \pard\plain \s7\fs32\lang1033\qc\fs20 MTA SOTE EKSZ
\par Neurobiol\'f3giai Kutat\'f3csoport
\par negyessy@ana.sote.hu
\par \pard\plain \s2\fs20\lang1038 
\par \pard\plain \s8\fs20\lang1038\qj A prefront\'e1lis k\'e9reg (PFC) m\'fbk\'f6d\'e9s\'e9nek meg\'e9rt\'e9se tudat- \'e9s hangulatzavarokat okoz\'f3 betegs\'e9gek meg\'e9rt\'e9s\'e9hez vezet k\'f6zelebb \'e9s alapvet\'f5 k\'e9rd\'e9s a kognit\'edv idegtudom\'e1nyban. A PFC magatart\'e1si szerep\'e9re vonatkoz\'f3an a legelfogadottabb n\'e9zet, hogy m\'fbk\'f6d\'e9s\'e9n keresz
t\'fcl val\'f3sul meg a munkamem\'f3ria, ill. annak v\'e9grehajt\'f3 funkci\'f3i. Az idegtudom\'e1ny szempontj\'e1b\'f3l a munkamem\'f3ria modell operat\'edv funkci\'f3ja a k\'fcl\'f6nb\'f6z\'f5 eredet\'fb k\'f6rnyezeti ill. tanult inform\'e1ci\'f3 idegi reprezent\'e1ci\'f3j\'e1nak id\'f5leges, akt\'edv form\'e1ban tart\'e1sa. A v\'e9greh
ajt\'f3 funkci\'f3 ezen inform\'e1ci\'f3 manipul\'e1ci\'f3ja, aminek erdm\'e9nye a c\'e9lszer\'fb magatart\'e1s. A PFC-re jellemz\'f5, hogy a neuronok aktivit\'e1sa er\'f5teljesen fokoz\'f3dik a r\'f6vid idej\'fb t\'e1rol\'e1st ig\'e9nyl\'f5 feladatokban, mint pl. a k\'e9sleltetett v\'e1laszreakci\'f3kon alapul\'f3 tesztek, va
lamint hogy ezen aktivit\'e1s g\'e1tl\'e1sa hib\'e1s v\'e1laszokat eredm\'e9nyez. E k\'e9sleltetett aktivit\'e1s teh\'e1t kiemelt fontoss\'e1ggal b\'edr az eml\'edtett funkci\'f3k ill. funkci\'f3zavarok szempontj\'e1b\'f3l. K\'f6nnyen bel\'e1that\'f3 tov\'e1bb\'e1, hogy a kell\'f5en flexibilis, m\'e9gis pontos magatart\'e1shoz
 elengedhetetlen e m\'fbk\'f6d\'e9s optim\'e1lis szab\'e1lyoz\'e1sa: ezen aktivit\'e1s t\'falzott er\'f5ss\'e9ge vagy instabilit\'e1sa perszever\'e1ci\'f3hoz vagy disztraktibilit\'e1shoz vezethet; mindkett\'f5 jellegzetes t\'fcnete a PFC hib\'e1s m\'fbk\'f6d\'e9s\'e9nek. A k\'e9sleltett aktivit\'e1s mechanizmus\'e1nak un. reve
rber\'e1ci\'f3n alapul\'f3 mechanisztikus modellje, ami k\'f6lcs\'f6n\'f6s kapcsolatban \'e1ll\'f3 neuronok k\'f6rk\'f6r\'f6s aktivit\'e1s\'e1t jelenti, m\'e1ra elvesz\'edtette magyar\'e1z\'f3 erej\'e9t. El\'f5ad\'e1somban arra szeretn\'e9k r\'e1vil\'e1g\'edtani, mit tudunk azokr\'f3l a k\'e9rgi \'e9s k\'e9reg alatti h\'e1l\'f3zatokr\'f3l, melyek 
integr\'e1ci\'f3ja sz\'fcks\'e9ges a PFC m\'fbk\'f6d\'e9si modellj\'e9nek teljesebb felv\'e1zol\'e1s\'e1hoz. 
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s7\fs32\lang1033\qc Szimbolikus neur\'e1lis h\'e1l\'f3zati sz\'e1m\'edt\'e1sok
\par \pard\plain \s2\fs20\lang1038\qc 
\par Palancz B\'e9la
\par \pard\plain \s2\fs20\lang1038\f6\i\qc Budapesti M\'fbszaki \'e9s Gazdas\'e1gtudom\'e1nyi Egyetem
\par \'c9p\'edt\'f5m\'e9rn\'f6ki Kar
\par Fotogrammetria \'e9s T\'e9rinformatika Tansz\'e9k
\par 1521 Budapest
\par palancz@epito.bme.hu 
\par \pard\plain \s2\fs20\lang1038\f6\b\qc 
\par \pard\plain \s2\fs20\lang1038\qj R\'f6vid \'e1ttekint\'e9st adunk a {\i Mathematica} \'faj, m\'e9g kereskedelmi forgalomban meg nem jelent alkalmaz\'f3i csomagjr\'f3l, a {\i Neural Networks}{\f9  csomagr\'f3l. Ennek egyik legfontosabb jellemz\'f5je, hogy a betan\'edtott neur\'e1lis h\'e1l\'f3zatot le\'edr\'f3 f\'fcggv\'e9nykapcsolat analitikusan is el\'f5\'e1
ll\'edthat\'f3, \'e9s \'edgy egyszer\'fben be\'e9p\'edthet\'f5 m\'e1s alkalmaz\'e1sokba. A csomag felhaszn\'e1l\'e1si lehet\'f5s\'e9geit sz\'e1mos, k\'fcl\'f6nb\'f6z\'f5 tudom\'e1nyter\'fcletr\'f5l v\'e1lasztott mintafeladat megold\'e1s\'e1nak bemutat\'e1s\'e1val  illusztr\'e1ljuk.}
\par \pard\plain \s7\fs32\lang1033\qc\fs20 
\par 
\par \pard\plain \s1\fs28\b\qc K\'eds\'e9rletes Sz\'e1melm\'e9let
\par \pard\plain \s1\qc Peth\'f5 Attila
\par Debreceni Egyetem
\par Sz\'e1m\'edt\'f3g\'e9ptudom\'e1nyi Tansz\'e9k
\par {\*\cs49\cf3\ul{\field{\*\fldinst HYPERLINK "http://neumann.math.klte.hu/~pethoe" }{\fldrslt \*\cs49\cf3\ul http://neumann.math.klte.hu/~pethoe}}}
\par \pard\plain \s1                                                               {{\field{\*\fldinst HYPERLINK "mailto:pethoe@math.klte.hu" }{\fldrslt \*\cs49\cf3\ul pethoe@math.klte.hu}}}
\par \pard\plain \s1\fs20 
\par \pard\plain \s1\f6\fs20 
\par \pard\plain \s1\li0\ri0\fi708\f6\fs20\qj A sz\'e1melm\'e9letben a k\'eds\'e9rleteknek nagy hagyom\'e1nya van, b\'e1r azt ink\'e1bb t\'e1bl\'e1zatok elemz\'e9s\'e9nek, sejt\'e9sek numerikus tesztel\'e9s\'e9nek nevezt\'e9k. K\'e9t klasszikus p\'e9ld\'e1t id\'e9zek erre, az egyik Gauss sejt\'e9se a pr\'edmsz\'e1mok eloszl\'e1s\'e1r\'f3l, amelyet k\'f6zel sz\'e1z \'e9vvel k\'e9s?bb biz
ony\'edtott de la Vall\'e9e Poussin \'e9s Hadamard, a m\'e1sik Riemann sejt\'e9se, amelyet m\'e1ig sem siker\'fclt bizony\'edtani. Gauss \'e9s Riemann is alapos numerikus elemz\'e9seket v\'e9gzett sejt\'e9seik megfogal-maz\'e1sa el?tt, persze "pap\'edron ceruz\'e1val".
\par A XX. sz\'e1zadban az elektronikus sz\'e1m\'edt\'f3g\'e9p \'f6tlete \'e9s az algoritmikus szeml\'e9let elter-jed\'e9se k\'f6vetkezt\'e9ben egyre t\'f6bb kutat\'f3t foglalkoztatott az, hogy a matematikai objektumok \'e1br\'e1zol\'e1s\'e1t, megjelen\'edt\'e9s\'e9t \'e9s az oper\'e1ci\'f3k algoritmikus k\'e9rd\'e9seit tanulm\'e1nyozz\'e1k
. A Lehmer h\'e1zasp\'e1r, Zassenhaus \'e9s Cassels munk\'e1ss\'e1ga \'e1tmenetet jelent a sz\'e1m\'edt\'f3g\'e9p el?tti \'e9s ut\'e1ni korba. Azok k\'f6z\'e9 tartoztak, akik felismert\'e9k, hogy a sz\'e1m\'edt\'f3g\'e9pek a matematika k\'eds\'e9rleti esz-k\'f6zei lehetnek. A kezdetek, az 1950-es \'e9vek elej\'e9nek, egyik leg
nagyobb hat\'e1s\'fa eredm\'e9nye a Birch \'e9s Swinnerton-Dyer sejt\'e9s, ami szerint elliptikus g\'f6rb\'e9k geometriai \'e9s analitikus rangja megegyezik. A kor\'e1bban eml\'edtett p\'e9ld\'e1khoz hasonl\'f3an ezt is numerikus p\'e9ld\'e1k t\'e1masztott\'e1k al\'e1, de a tesztel\'e9st m\'e1r sz\'e1m\'edt\'f3g\'e9ppel v\'e9gezt
\'e9k. 
\par \pard\plain \s1\li0\ri0\fi708\f6\qj{\fs20 Diofantikus egyenletek megold\'e1sa \'f5sid\'f5k \'f3ta a sz\'e1melm\'e9leti kutat\'e1sok egyik \'e9rdekes fejezete. Szisztematikus elm\'e9letr\'f5l azonban csak a XX. sz\'e1zadban besz\'e9lhet\'fcnk, v\'e9lem\'e9ny\'fcnk szerint Hilbert 1900-ban megfogalmazott k\'e9t probl\'e9m\'e1ja nyom\'e1n. Debrecenben a 80-as
 \'e9vek elej\'e9t\'f5l kapcsol\'f3dtunk be ezekbe a kutat\'e1sokba. Algoritmusokat fejlesztett\'fcnk ki \'e9s nemzet-k\'f6zi egy\'fcttm\'fbk\'f6d\'e9sben implement\'e1ltunk Thue-, indexforma-, elliptikus \'e9s m\'e1s egyenletek megold\'e1s\'e1ra \'e9s nagy mint\'e1kra alkalmaztuk azokat. A legfontosabb, szeml\'e9l
etet m\'f3dos\'edt\'f3, eredm\'e9ny az volt, hogy ezen egyenleteknek nincs nagy megold\'e1sa. Numerikus vizsg\'e1lataink m\'f3dszerei befoly\'e1solt\'e1k az elm\'e9leti megfontol\'e1sokat is; jobban figyelnek a konstansokra \'e9s expliciten meghat\'e1rozz\'e1k azokat valamint jelent\'f5sen finomodott
 n\'e9h\'e1ny t\'e9tel bizony\'edt\'e1s\'e1nak a technik\'e1ja. 20 \'e9vvel ezel\'f5tt egyszer\'fb  Thue vagy elliptikus egyenlet megold\'e1s\'e1r\'f3l m\'e9g j\'f3 foly\'f3iratban lehetett dolgozatot k\'f6z\'f6lni, ma ezen feladatok megold\'e1sa rutin feladat egy alkalmasan megv\'e1lasztott komputer-sz\'e1melm\'e9leti s
zoftvernek. Az eredm\'e9nyek elemz\'e9sekor azonban aj\'e1nlatos} {\fs20 az \'f3vatoss\'e1g, hiszen \'e1ltal\'e1ban azt a v\'e1laszt kapjuk, hogy a feladatnak csak trivi\'e1lis megold\'e1sa van. A helyzet hasonl\'f3 a pr\'edmtesztekhez, amikor gyors val\'f3sz\'edn\'fbs\'e9gi m\'f3dszerekkel m\'e1r majdnem bizonyosak 
lehet\'fcnk abban, hogy az adott sz\'e1m pr\'edmsz\'e1m, de a prec\'edz matematikai igazolv\'e1ny sokkal f\'e1rads\'e1gosabban \'e1ll\'edthat\'f3 ki.}
\par \pard\plain \s1\li0\ri0\fi708\f6\fs20\qj 
\par \pard\plain \s1\li0\ri0\fi708\fs20\qj 
\par \pard\plain \s7\fs32\lang1033\qc\fs20 
\par 
\par 
\par \pard\plain \s7\fs32\lang1033\qc Keres\'e9s, sz\'f6vegek, Internet, algebra, algoritmusok
\par \pard\plain \s2\fs20\lang1038\qc 
\par R\'f3nyai Lajos
\par \pard\plain \s2\fs20\lang1038\f9\i\qc Budapesti M\'fbszaki \'e9s Gazdas\'e1gtudom\'e1nyi Egyetem
\par \pard\plain \s2\fs20\lang1038\i\qc Term\'e9szettudom\'e1nyi Kar
\par Algebra Tansz\'e9k
\par 1521 Budapest
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj Az inform\'e1ci\'f3 kor\'e1t \'e9lj\'fck. Az egyik legnagyobb gond, hogy mik\'e9nt tal\'e1lhatjuk meg az \'f3r\'e1si inform\'e1ci\'f3s sz\'e9nakazalban azt a t\'fbt, amit \'e9ppen keres\'fcnk. Az evvel kapcsolatos eredm\'e9nyek k\'f6z\'fcl kett\'f5vel szeretn\'e9k foglalkozni. Az egyik a M\'f6g\'f6ttes Szemanik\'e1j\'fa Indexe
l\'e9s elnevez\'e9s\'fb keres\'f5m\'f3dszer, a m\'e1sik a tal\'e1latok k\'f6z\'f6tti fontoss\'e1gi sorrend becsl\'e9s\'e9t c\'e9lz\'f3 Kleinberg-algoritmus.
\par 
\par A k\'e9t megk\'f6zel\'edt\'e1s k\'f6z\'f6s von\'e1sa, hogy line\'e1ris algebrai modellt alkalmaz. Eg\'e9szen m\'e1s m\'f3don, de mindkett\'f5 a m\'e1trixok szingul\'e1ris \'e9rt\'e9k szerinti felbont\'e1s\'e1hoz (SVD) kapcsol\'f3dik.
\par 
\par Ek\'f6zben alkalmunk lesz besz\'e9lni L\'e1nczos Korn\'e9lr\'f3l, a line\'e1ris algebrai sz\'e1m\'edt\'e1sok zsenij\'e9r\'f5l, \'e9s a gondolkod\'e1sban el\'f5fordul\'f3 szerencs\'e9s k\'f6rk\'f6r\'f6ss\'e9gr\'f5l is.
\par \pard\plain \s2\fs20\lang1038\fs24\qc 
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc V\'e9letlen Boole-h\'e1l\'f3zatok dinamik\'e1ja
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc Somogyv\'e1ri Zolt\'e1n
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI Biofizikai Oszt\'e1ly 
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s1\qc{{\field{\*\fldinst HYPERLINK "mailto:soma@sunserv.kfki.hu" }{\fldrslt \*\cs49\cf3\ul soma@sunserv.kfki.hu}}}
\par \pard\plain \s1\fs20\qc 
\par 
\par \pard\plain \s1\qj{\fs20 A v\'e9letlen Boole-h\'e1l\'f3zatok tipikus p\'e9ld\'e1i az egyszer\'fb elemekb\'f5l fel\'e9p\'fcl\'f5 komlex viselked\'e9s\'fb rendszereknek.Sz\'e1mos bonyolult, nemline\'e1ris, biol\'f3giai h\'e1l\'f3zat absztrakt modellkeretek\'e9nt alkalmazt\'e1k \'f5ket, p\'e9ld\'e1ul: egym\'e1st regul\'e1l\'f3 g\'e9nek rendszer\'e9re, egym\'e1ssal k
\'f6lcs\'f6nhat\'f3 kataliz\'e1torok rendszer\'e9re - mint amilyenek az \'e9let kezdet\'e9nek molekul\'e1ris rendszerei lehettek -, csatolt koevol\'faci\'f3s rendszerekre \'e9s neuronh\'e1l\'f3zatokra. Szint\'e9n szoros kapcsolatban vannak a statisztikus fizika klasszikus modelljeivel, pl az Ising
 modellel es a perkol\'e1ci\'f3 elm\'e9lettel}.
\par \pard\plain \s1\fs20\qj  Viselked\'e9s\'fck jellegzetes f\'e1zis\'e1tmenetet mutat az egy elemre es\'f5 kapcsolatsz\'e1m f\'fcggv\'e9ny\'e9ben. A kritikus kapcsolts\'e1g f\'f6l\'f6tt "kaotikusan" - illetve a kaotikus viselked\'e9s diszkr\'e9t anal\'f3gjak\'e9nt - viselkednek, a kritikus kapcsolats\'fbr\'fbs\'e9g alatt stabil peri\'f3dikus
 viselked\'e9st mutatnak. Munk\'e1nk c\'e9lja egyr\'e9szt anal\'edtikus k\'f6zel\'edt\'e9st adni a sok\'e1ig csak numerikus szimul\'e1ci\'f3kkal tanulm\'e1nyozott jeles\'e9gekre, m\'e1sr\'e9szt meg\'e9rteni az elveket, amelyek e strukt\'far\'e1j\'e1ban egyszer\'fb, dinamik\'e1j\'e1ban m\'e9gis komplex rendszer viselked\'e9sem 
m\'f6g\'f6tt h\'faz\'f3dnak.
\par \pard\plain \s1\fs20\qc 
\par \pard\plain \s7\fs32\lang1033\qc Szimbolikus dinamika \'e9s form\'e1lis nyelvek
\par \pard\plain \s2\fs20\lang1038\qc 
\par Szaliszny\'f3 Kriszta
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI Biofizikai Oszt\'e1ly 
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:szali@cns.nyu.edu" }{\fldrslt \*\cs49\cf3\ul szali@}}}sunserv.kfki.hu
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par 
\par \pard\plain \s1  
\par 
\par 
\par 
\par \pard\plain \s7\fs32\lang1033\qc K\'f6zponti idegrendszer szerkezete:
\par az agyt\'f3l a szinapszisokig
\par \pard\plain \s2\fs20\lang1038\qc 
\par Sz\'e9kely Andrea Dorottya
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc Semmelweis Egyetem Anat\'f3miai, Sz\'f6vet-\'e9s Fejl\'f5d\'e9staniInt\'e9zet
\par Budapest IX., T\'fbzolt\'f3 u. 58. H-1094
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:szali@cns.nyu.edu" }{\fldrslt \*\cs49\cf3\ul a}}}dszekely@ana.sote.hu
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par 
\par \pard\plain \s1\f6\fs20  A k\'f6zponti idegrendszer feladata a k\'fclvil\'e1gb\'f3l sz\'e1rmaz\'f3 ingerek, inform\'e1ci\'f3k felv\'e9tele, feldolgoz\'e1sa, rakt\'e1roz\'e1sa \'e9s egyben a megfelel\'f5 v\'e1lasz gener\'e1l\'e1sa. E feladat megval\'f3s\'edt\'e1sra szolg\'e1l az a komplex neuron\'e1lis strukt\'fara, amely a t\'f6rzsfejl\'f5d\'e9s sor\'e1n domi
n\'e1nsan a test k\'f6z\'e9pvonal\'e1ba \'e9s feji v\'e9g\'e9re helyez\'f5d\'f6tt. R\'e9szei: nagyagy, kisagy, agyt\'f6rzs, gerincvel\'f5. 
\par 
\par    Az eml\'f5s agy szerkezete meglehet\'f5sen konzervat\'edv, az el\'f5z\'f5 gerinces oszt\'e1lyokhoz k\'e9pest \'fajdons\'e1g az agyk\'e9reg kialakul\'e1sa. A k\'e9reg a konvencion\'e1lis felfog\'e1s szerint hatr\'e9teg\'fb, \'e1m az egyes k\'e9rgi mez\'f5k funkci\'f3juk illetve fejl\'f5d\'e9stani korukn\'e1l fogva ett\'f5l e
lt\'e9r\'f5 morfol\'f3gi\'e1t mutatnak. Az agyk\'e9reg funkcion\'e1lis moduljai a k\'e9rgi kolumn\'e1k (pl. a l\'e1t\'f3rendszer orient\'e1ci\'f3s \'e9s egym\'e1ssal altern\'e1l\'f3 okul\'e1ris dominancia oszlopai). 
\par 
\par    Az idegrendszer alkot\'f3elemei a neuronok (ny\'falv\'e1nyos sejtek), serkent\'f5 (projekci\'f3s), illetve g\'e1tl\'f3 (lok\'e1lis sejt) oszt\'e1lyokat alkotnak, noha a hat\'e1rok nem h\'fazhat\'f3ak meg szigor\'faan. Az idegsejtek k\'f6z\'f6tt l\'e9trej\'f6v\'f5 kapcsolatok a szinapsisok, m\'fbk\'f6d\'e9s\'fck (serke
nt\'f5-g\'e1tl\'f3) \'e9s morfol\'f3gi\'e1juk (aszimmetrikus-szimmetrikus) szerint csoportos\'edthat\'f3ak. 
\par 
\par    Mivel az idegsz\'f6veti \'e9p\'edt\'f5elemek identikusak mindegyik gerinces oszt\'e1lyban, az \'f6sszehasonl\'edt\'f3 neuroanat\'f3mia egyik legizgalmasabb k\'e9rd\'e9se, hogyan tudja k\'e9t k\'fcl\'f6nb\'f6z\'f5 szervez\'f5d\'e9s\'fb neuronrendszer ugyanazt a feladatot egyforma eredm\'e9nnyel kivitelezni (pl. m
adarak daltanul\'e1sa, t\'e9rbeli mem\'f3ria kialakul\'e1sa). 
\par \pard\plain \s1\f6\fs20\qj 
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par \pard\plain \s7\fs32\lang1033\qc{\i Mathematica} \'e9s komput\'e1ci\'f3tudom\'e1ny
\par \pard\plain \s2\fs20\lang1038\qc 
\par T\'f3th J\'e1nos
\par {{\field{\*\fldinst HYPERLINK "http://www.math.bme.hu/~jtoth" }{\fldrslt \*\cs49\cf3\ul http://www.math.bme.hu/~jtoth}}}
\par \pard\plain {\listtext\pard\plain \keepn\f9\fs20\lang1038\i\qc }\s4\ls2\ilvl1\outlinelevel1\keepn\fs20\lang1038\i\qc\li0\ri0\fi0\f9 Budapesti M\'fbszaki \'e9s Gazdas\'e1gtudom\'e1nyi Egyetem
\par \pard\plain \s2\fs20\lang1038\i\qc Term\'e9szettudom\'e1nyi Kar
\par Matematikai Anal\'edzis Tansz\'e9k
\par 1521 Budapest
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:jtoth@math.bme.hu" }{\fldrslt \*\cs49\cf3\ul jtoth@math.bme.hu}}}
\par \pard\plain \s2\fs20\lang1038\i\qc  
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par Az el\'f5ad\'e1s c\'e9lja, hogy felh\'edvja a figyelmet arra: a {\i Mathematica} programcsomag nyilv\'e1nval\'f3 k\'e9pess\'e9gein (szimbolikus \'e9s numerikus sz\'e1mol\'e1s, \'e1br\'e1zol\'e1s, anim\'e1ci\'f3, hangkelt\'e9s, publikci\'f3 pap\'edron \'e9s weben) t\'falmen\'f5en k\'fcl\'f6nlegesen alkalmas lenne a sz\'e1m\'edt\'e1studom\'e1ny 
elemeinek oktat\'e1s\'e1ra. A p\'e9ld\'e1k k\'f6z\'f6tt szerepel a rekurzi\'f3, a listakezel\'e9s, a mintailleszt\'e9s, p\'e9ld\'e1k a funkcion\'e1lis programoz\'e1sra, {\f4 l}-kalkulus \'e9s egyebek.
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b Irodalom:
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Gray, J. W.: {\i Mastering Mathematica. Programming Methods and Applications.} AP Professional, Boston etc., 1994.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Maeder, R. E.: {\i Computer Science with Mathematica. Theory and Practice for Science, Mathematics, and Engineering,} Cambridge University Press, Cambridge, 2000.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Szili, L., T\'f3th, J.: {\i Matematika \'e9s Mathematica,} ELTE E\'f6tv\'f6s Kiad\'f3, Budapest, 1996.
\par \pard\plain \s6\f3\fs20\lang1038\li360\ri0\fi0\qj 
\par \pard\plain \s2\fs20\lang1038\qj 
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b Abstracts and authors{\lang1033 \rquote  data in English}
\par \pard\plain \s2\fs20\lang1038\lang1033 
\par 
\par \pard\plain \s7\fs32\lang1033\qc Boolean function calculus with some application
\par 
\par \pard\plain \s2\fs20\lang1038\qc F\'fcl\'f6p Bazs\'f3
\par \pard\plain \s2\fs20\lang1038\f6\fs32\i\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI 
\par  Department of Biophysics
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc 
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:bazso@sunserv.kfki.hu" }{\fldrslt \*\cs49\cf3\ul bazso@sunserv.kfki.hu}}}
\par 
\par \pard\plain \s2\fs20\lang1038\f6\i\qj                   Dynamic phenomenological modells can be created to model neural and other networks
\par                   by iterating Boolean functions. We may comprehend the basic dynamical properties of 
\par                   such networks. It can be shown, that in the dynamical systems defined this way the notions
\par                  and means used in continuous dynamics find their paralell. 
\par \pard\plain \s2\fs20\lang1038\f6\lang1033\i\qj                  We illustrate some introduced notions through several examples.
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par \pard\plain \s7\fs32\lang1033\qc Networks of language processors: bio-inspired models of computing 
\par \pard\plain \s2\fs20\lang1038\qc 
\par Erzs\'e9bet Csuhaj-Varj\'fa
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc Computer and Automation Research Institute
\par Hungarian Academy of Sciences
\par \pard\plain \s2\fs20\lang1038\i\qc H-1111 Budapest, Kende u.13-17.
\par 
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:csuhaj@sztaki.hu" }{\fldrslt \*\cs49\cf3\ul csuhaj@sztaki.hu}}}
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj Networks of language processors (NLP systems) are unconventional models of computing, introduced for describing the behaviour of communities of dynamically changing and communicating agents in terms of formal grammars and languages.
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj A network of language processors is a virtual graph with a language identifying mechanism (a grammar, an automaton, etc.) and a set or a multiset of words located at each node. These language processors work in a synchronized manner by performing rewriting
 steps and communication steps. At a rewriting step, each language processor rewrites the strings (or some of them) that can be found at that moment at the node, and then a communication step follows. At this step, the language processors, according to the
 communication protocol of the network, communicate the previously rewritten strings to the other nodes. A sequence of alternating rewriting steps and communication steps determine a computation in the network. The result of the computation can be defined 
as the set or the multiset of words which can be found at a dedicated node under computation or at some previously fixed step of the computation.
\par 
\par Networks of language processors are not only tools for computation (determining languages) but also can be used for studying questions as the description of the dynamics of string multisets at the nodes. If the words are considered as descriptions of organ
isms or they identify DNA sequences, then NLP systems can be useful in describing the behaviour of interacting populations with dynamically changing members.
\par 
\par In this talk we discuss two variants of NLP systems, networks of Lindenmayer systems and networks of Watson-Crick Lindenmayer systems, both demonstrating the power of this framework. In the case of networks of Lindenmayer systems the component language pro
cessors are grammars with totally parallel rewriting,  modelling developmental systems.  In the case of Watson-Crick Lindenmayer systems the totally parallel rewriting (the development) is triggered by a fundamental property of DNA computing, the Watson-Cr
ick complementarity. We show that both models, even with very simple language processors and communication protocols, are as powerful as the Turing machines, moreover, for the massive parallelism some well-known NP-complete problems can be solved by these 
constructs in linear time. Finally, we demonstrate a method for describing the  dynamics of the string multisets occurring under computation in these networks.
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b References:
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls0{\f1 E. Csuhaj-Varj\'fa}{\f9 : Networks of Language Processors. EATCS Bulletin 63 (1997), 120-134. Appears also in  Gh. P\'e3un, G.Rozenberg, A.Salomaa (eds.) Current Trends in Theoretical Computer Science, World Scientific, Singapore, 2001, 771-790.}
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls0{\f1 E. Csuhaj-Varj\'fa and A. Salomaa, Netwo}{\f9 rks of parallel language processors. In: New Trends in Computer Science, Cooperation, Control, Combinatorics. (Gh. P\'e3un and  A. Salomaa, eds.), LNCS 1218, Springer-Verlag, Berlin-Heidelberg-New York, 1997, 299-318. }
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls0 E. Csuhaj-Varj\'fa and A. Salomaa, Networks of Watson-Crick D0L systems. TUCS Report 419, Turku Centre for Computer Science, Turku, 2001. To appear in Proc. Third International Conference on Words, Languages, and Combinatorics, Kyoto, 2000. (M. Ito, ed.), Wor
ld Scientific, Singapore, 2002.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls0{\f9 G. P\'e3un,}{\f1  G. Rozenberg and A. Salomaa, DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin, Heidelberg, New York (1998).}
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\f3\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\qj\ls0{\f1 Handbook of Formal Languages, Vol. I-III. (G. Rozenberg and  A. Salomaa, eds.) Springer Verlag, Berlin, Heidelberg, New York, 1997.} 
\par \pard\plain \s2\fs20\lang1038\qj 
\par 
\par \pard\plain \s6\f3\fs20\lang1038\f1\fs32\qc Linguistic Capacity: Associative or Combinatory?
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qc L\'e1szl\'f3 K\'e1lm\'e1n
\par Mindmaker Ltd., Budapest
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:kalman@mindmaker.hu" }{\fldrslt \*\cs49\cf3\ul kalman@mindmaker.hu}}}
\par 
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj Chomskyan models of natural-language grammars, based on formal language theory, crucially rely on the assumption that linguistic knowledge contains two different components, namely, one combinatory system (syntax) and one that contains knowledge about the 
use of elementary building blocks (lexicon).  Post-Chomskyan theories of grammar (in particular, Construction Grammar) posits that words and syntactic structures (and whatever is in between) must be treated in a homogeneous manner, since they are all alike
 in that they consist in associations of formal properties with semantic ones.  In accordance with this, constructionism says we do not use linearly ordered sequences consisting of lexical building blocks in linguistic communication, but complex and possib
ly overlapping patterns (constructions) arising from the simultaneous satisfaction of various constraints.
\par 
\par Mindmaker Ltd. are trying to implement such a post-Chomskyan grammar within the paradigm of `integrated NLP'.  In this implementation, constructions constitute a network, and they activate each other through associations.  Yet, each carries essentially sym
bolic information, and the task is essentially combinatory.  It is unclear for the moment how familiar sub-symbolic representation and learning systems (e.g., connectionism) can account for this double character of  the NLP task.
\par \pard\plain \s6\f3\fs20\lang1038\fs24 
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\lang1033\qc Stephen Wolfram: {\i A New Kind of Science}
\par 
\par \pard\plain \s2\fs20\lang1038\lang1033\qc Book review by {\i Lajos L\'f3czi}
\par \pard\plain \s2\fs20\lang1038\lang1033\i\qc 
\par \pard\plain \s2\fs20\lang1038\i\qc Budapest University of Technology and Economics, Faculty of Sciences
\par Department of Differential Equations
\par 1521 Budapest
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:lloczi@math.bme.hu" }{\fldrslt \*\cs49\cf3\ul lloczi@math.bme.hu}}}
\par \pard\plain \s2\fs20\lang1038\lang1033\i 
\par \pard\plain \s2\fs20\lang1038\lang1033\qj The long-awaited book of Stephen Wolfram has been completed. This massive, 1197-page tome is a great intellectual achievement: one of his friends suggested it should be called {\i Principia} {\i Computatus}. Using the early results of his investigations into the beh
aviours of {\i cellular} {\i automata}, and the technical computing system {\i Mathematica }he created, the book presents a huge number of examples of various scientific disciplines where simple rules generate immensely complex results. The book culminates in the {\i Princip
le of Computational Equivalence} implying that at some level of complexity {\i everything} is exactly as complex as anything else. 
\par {\i A New Kind of Science} is a readable book sharing his ideas with scientists and also with nonscientists. Throughout the book, emphasis is placed on the {\i algorithm} rather than the {\i equation}. Wolfram predicts it will have unprecedented implications for science 
and scientific thinking.
\par 
\par \pard\plain \s2\fs20\lang1038 
\par \pard\plain \s7\fs32\lang1033\qc Reverberation, perseveration, distractibility: questions about the function of neural networks of the prefrontal cortex 
\par \pard\plain \s7\fs32\lang1033\qc\fs20 
\par L\'e1szl\'f3 N\'e9gyessy
\par 
\par Semmelweis University
\par Department of Anatomy
\par Neurobiology Research Group
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:Palancz@epito.bme.hu" }{\fldrslt \*\cs49\cf3\ul negyessy@ana.sote.hu}}}
\par \pard\plain \s7\fs32\lang1033\qc\fs20 
\par \pard\plain \s2\fs20\lang1038 
\par 
\par \pard\plain \s8\fs20\lang1038\qj Understanding the function of the prefrontal cortex (PFC) is crucial to reveal the biological mechanisms of thought\endash  and mood disorders and it is also a central question in cognitive neuroscience. It is widely accepted that PFC plays essential role in work
ing memory, especially in executive functions, a main component of working memory. >From neurobiological perspective the function of working memory is maintaining neural representations of different kind of sensory or learned information temporally in acti
vated form for on-line processing. Manipulation of this information held in working memory by executive functions is a necessary step to goal directed behavior. A characteristic feature of neuronal activity of the PFC is the vigorous response in tasks requ
iring short term retention of information, like delay response tasks. Disturbance of this activity results in faulty behavioral responses indicating its central role in normal functions as well as clinical symptoms. It seems obvious that optimal regulation
 of delay-related activity is essential for flexible and at the same time accurate behavior. Indeed, irresistible activity or instability of it leads to perseveration or distractibility, respectively, which are characteristic symptoms of prefrontal dysfunc
tion. The original idea about the neuronal mechanisms underlying delay-related activity was that reverberation of activity between interconnected neurons. However, this mechanistic proposal has a limited explanatory power considering the diversity of circu
its integrated in the PFC. Accordingly, the purpose of this talk is to give an introduction about the state of our knowledge regarding on the organizational principles of these cortical and subcortical networks whose activities are needed to be integrated 
in a comprehensive model of the PFC.
\par \pard\plain \s2\fs20\lang1038 
\par 
\par \pard\plain {\listtext\pard\plain \keepn\fs32\qc }\s3\ls2\ilvl0\outlinelevel0\keepn\fs32\lang1033\qc\li0\ri0\fi0 Symbolic Neural Networks Computations
\par \pard\plain \s2\fs20\lang1038\qc 
\par B\'e9la Pal\'e1ncz
\par 
\par \pard\plain \s2\fs20\lang1038\i\qc Department of Photogrammetry and Geoinformatics, Civil Engineering Faculty
\par Budapest University of Technology and Economics
\par H-1521 Budapest, Hungary
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:Palancz@epito.bme.hu" }{\fldrslt \*\cs49\cf3\ul Palancz@epito.bme.hu}}}
\par \pard\plain \s2\fs20\lang1038\i\qc 
\par \pard\plain \s2\fs20\lang1038\lang1033\qj 
\par \pard\plain \s2\fs20\lang1038\qj An overview is given about the {\i Neural Networks}, the recently developed, but not yet released application of {\i Mathematica}.  The most significant feature of this package, that the symbolic form of a trained network can be produced, consequently it is an easy 
job to implement it into other applications.
\par Examples from different fields of sciences will demonstrate the usage of the different type of networks, which are available in the {\i Neural Networks} application.  
\par  {\i  }
\par \pard\plain \s2\fs20\lang1038\i\qj 
\par \pard\plain \s7\fs32\lang1033\qc Experimental Number Theory
\par \pard\plain \s7\fs32\lang1033\qc\f9\fs20\i 
\par \pard\plain \s2\fs20\lang1038\i\qj 
\par \pard\plain \s1\qc Attila Peth\'f5
\par University of Debrecen
\par Department of Computer Science
\par {\*\cs49\cf3\ul{\field{\*\fldinst HYPERLINK "http://neumann.math.klte.hu/~pethoe" }{\fldrslt \*\cs49\cf3\ul http://neumann.math.klte.hu/~pethoe}}}
\par \pard\plain \s1  
\par 
\par \pard\plain \s1\li0\ri0\fi708\qj Experiments have in number theory a long tradition, although they were called rather as examination of tables or numerical test of conjectures. I cite here only two classical examples; the first is Gauss' conjecture on the distribution of primes, which was
 proved nearly hundred years later by de la Vall\'e9e Poussin and Hadamard, the second is Riemanns conjecture, which is still unproved. Both Gauss and Riemann did thorough numerical investigations with "pencil on paper" before stating the conjectures. 
\par In the 20th century because of the idea of computers and the development of the algorithmic point of view more and more researcher were interested for the representation of mathematical objects and algorithmic aspects of operations. The investigations of D
erek and Emma Lehmer, Zassenhaus and Cassels means a transition from the precomputer to the computer age. {\f6 They belong to those scientists, who realized that computers may become experimental facilities for mathematics. One of the most important results of 
the beginning, i.e. of the 1950's, was the conjecture of  Birch and Swinnerton-Dyer conjecture, by which the analytic and geometric rank of elliptic curves is equal. It was stated again after long and careful numerical tests, but this time the tests were d
one by computers. }
\par \pard\plain \s1\li0\ri0\fi708\f6\qj The solution of diophantine equations is an interesting branch of number theory since ancient ages. A systematic theory exists only since the beginning of the 20th century, by our opinion since the talk of Hilbert at the 2nd Conference of Mathematicians in
 Paris, 1900. In Debrecen investigations started in this directions in the early 80th. We developed algorithms among others for the solution of Thue-, index form- and elliptic equations, implemented and applied them for large sets of input data. Our most i
mportant result was that such equations have usually only small solutions. Our numerical results influenced the theoretical investigations; the explicit determination and the size of constants are playing nowadays an important role and the proof of several
 theorems were simplified. 20 years ago one could publish a paper in a good journal about the solution of a simple Thue or elliptic equation, today this is a routine problem for a well-chosen computer number theory software. By the examination of the resul
ts one should be careful, because the usual answer is that the problem has only trivial solutions. The situation is similar to the primality tests. If a number survives fast probability tests, then it is quite certainly a prime, but a certificate of its pr
imality can be found hardly.
\par \pard\plain \s2\fs20\lang1038\f6\fs24\qj 
\par \pard\plain \s7\fs32\lang1033\qc Indexing, texts, Internet, algebra, algorithms
\par \pard\plain \s6\f3\fs20\lang1038\f6\qc 
\par \pard\plain \s6\f3\fs20\lang1038\f6 
\par R\'f3nyai Lajos
\par 
\par Computer and automation 
\par Research Institute of the Hungarian Academy of Science
\par H-1111 Hungary, L\'e1gym\'e1nyosi u. 11
\par \pard\plain \s6\f3\fs20\lang1038 
\par \pard\plain \s7\fs32\lang1033\qc{{\field{\*\fldinst HYPERLINK "mailto:pethoe@math.klte.hu" }{\fldrslt \*\cs49\cf3\ul ronyai@sztaki.hu}}}
\par \pard\plain \s2\fs20\lang1038\i\qc 
\par \pard\plain \s6\f3\fs20\lang1038\i\qj 
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\qj We live in the Information Age. One of our major concerns in this regard is to find the needle (piece of data) in the huge haystack of information we have around.  We shall discuss two related results. One  is Latent Semantic Indexing for document retrieva
l, the other is Kleinberg's algorithm for ranking the hits of a search.
\par 
\par A common feature of the two approaches is that they both employ models of linear algebraic nature. In quite different ways both of them are connected to singular value decomposition (SVD) of matrices.
\par 
\par Meanwhile we shall have opportunity to speak about Cornelius L\'e1nczos, the genius of linear algebraic computations, and the fortuitous kind of circularity which is present in certain patterns of reasoning.
\par \pard\plain \s2\fs20\lang1038\i\qj 
\par 
\par                                           {\fs32 Dynamics of random Boolean networks }
\par \pard\plain \s2\fs20\lang1038\fs32\i\qj                                                   {\f9 Somogyv\'e1ri Zolt\'e1n}
\par                                            
\par                                 
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI 
\par  Department of Biophysics
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc 
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:bazso@sunserv.kfki.hu" }{\fldrslt \*\cs49\cf3\ul soma@sunserv.kfki.hu}}}
\par \pard\plain \s2\fs20\lang1038\fs32\i\qj               
\par \pard\plain \s2\fs20\lang1038\i\qj 
\par 
\par \pard\plain \s1\f6\fs20\i\qj Random Boolean networks are typical examples of simple systems exhibiting complex behaviour and were first introduced and applied to biological networks by Kauffman. They become model systems of many complex biological networks. This type of networks were 
applied as an abstract model of numerous nonlinear complex systems: systems of interacting catalysts at the origins of life, self-regulatory genomic systems, coupled co-evolutionary ecosystems and neural networks. Behaviour of cellular networks is also clo
sely related to classical models of statistical physics such as the Ising model and percolation theory. Their behaviour show a typical phase transition depending on the number of connections. Over the critical treshold, they show "chaotic" behaviour or at 
least a discrete analog of a chaotic system. Under threshold connectivity they show stable periodic behaviour. The aim of our work was to provide an analytical approximation for the statisical parameters of lengths of attractors and transients, and to give
 a schema to understand the principles underlying the behaviour of this (structurally) simple but (dynamically) complex system.
\par \pard\plain \s2\fs20\lang1038\f6\i\qj 
\par 
\par \pard\plain \s7\fs32\lang1033\qc Symbolic dynamics and formal languages
\par \pard\plain \s2\fs20\lang1038\qc 
\par Kriszta Szaliszny\'f3
\par 
\par \pard\plain \s1\fs32\i\qj 
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc MTA KFKI RMKI 
\par  Department of Biophysics
\par H-1121 Budapest, Konkoly Thege u. 29-33.
\par \pard\plain \s6\f3\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html" }{\fldrslt \*\cs49\cf3\ul http://www.rmki.kfki.hu/biofiz/cneuro/cneuro.html}}}
\par \pard\plain \s6\f3\fs20\lang1038\f1\i\qc 
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:bazso@sunserv.kfki.hu" }{\fldrslt \*\cs49\cf3\ul szali@sunserv.kfki.hu}}}
\par \pard\plain \s2\fs20\lang1038\fs32\i\qj               
\par 
\par \pard\plain \s2\fs20\lang1038\fs32\i\b\qj 
\par \pard\plain \s11\sa120\fs28\qj 
\par \pard\plain \s11\sa120\qj 
\par                                                  {\fs32  {\i The organization of the CNS:}}
\par \pard\plain \s11\sa120\fs32\i\qj                                        from brain to synapse
\par \pard\plain \s2\fs20\lang1038\qc 
\par Andrea D. Sz\'e9kely
\par 
\par \pard\plain \s2\fs20\lang1038\i\qc Semmelweis University, 
\par Department of Anatomy, Histology and Embryology
\par           T\'fazolt\'f3 u.58.
\par H-1094 Budapest, Hungary
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:jtoth@math.bme.hu" }{\fldrslt \*\cs49\cf3\ul adszekely@ana.sote.hu}}}
\par \pard\plain \s11\sa120\i\qj 
\par \pard\plain \s11\sa120\qj 
\par \pard\plain \s11\sa120\f6\fs20\qj A major role for the central nervous system is the perception, processing and storage of information deriving from the external environment, while generating an adequate answer. The ultimate equipment for this task is an intricate neuronal complex, which, 
during phylogeny has gained both a midline and cranial position. The CNS of mammals can be subdivided to cerebrum, cerebellum, brain stem and\~ spinal cord.
\par The fine structure of the mammalian brain is rather conserved and the emergence of the cerebral cortex counts as a novelty when compared to other vertebrate classes. The cortex, according to the traditional histological description, consists of 6 layers, h
owever, certain cortical fields may differ due to their developmental origin or even functional profile. The functional moduls of the cortex are represented by a columnar system, such as the orientation columns or the ocular dominance columns in the visual
 cortex. 
\par The morphological units of the nerve tissue are embodied by neurones (cells generally with processes) they may be classified as excitatory\~ (projection), or inhibitory (local interneurons), however, some further neuronal types exist. The neurons establish 
contacts via synapses which may also be classified as excitatory-inhibitory or asymmetrical-symmetrical on the basis of their morphology. 
\par \pard\plain \s11\sa120\f6\fs20\i\qj While the basic elements are identical in all vertebrate classes, it is however one of the most exciting questions in comparative neuroanatomy to find out how two completely differently organised neuronal organs may successfully fulfill the same role, such
 as mammalian and avian vocalisation or spatial orientation.
\par \pard\plain \s2\fs20\lang1038\f6\i\qj 
\par \pard\plain \s1\f6\fs20 
\par \pard\plain \s2\fs20\lang1038\lang1033\qj 
\par \pard\plain \s7\fs32\lang1033\qc{\i Mathematica} and Computer Science
\par \pard\plain \s2\fs20\lang1038\qc 
\par J\'e1nos T\'f3th
\par 
\par \pard\plain \s2\fs20\lang1038\i\qc Department of Mathematical Analysis, Faculty of Sciences
\par Budapest University of Technology and Economics
\par H-1521 Budapest, Hungary
\par \pard\plain \s2\fs20\lang1038\qc{{\field{\*\fldinst HYPERLINK "mailto:jtoth@math.bme.hu" }{\fldrslt \*\cs49\cf3\ul jtoth@math.bme.hu}}}
\par \pard\plain \s2\fs20\lang1038\i\qc  
\par \pard\plain \s2\fs20\lang1038\qj 
\par Our aim is to show that the mathematical program package {\i Mathematica }is not only useful in solving problems involving symbolic and numerical calculations, graphics, animation, sound generation and publication on paper and on the web, but also to teach elem
ents of computer science such as list processing, pattern matching, functional programming, recursion, {\f4 l}-calculus etc.
\par \pard\plain \s5\sb240\sa60\keepn\f2\fs26\lang1038\b Reference:
\par \pard\plain \s6\f3\fs20\lang1038\qj 
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Gray, J. W.: {\i Mastering Mathematica. Programming Methods and Applications.} AP Professional, Boston etc., 1994.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Maeder, R. E.: {\i Computer Science with Mathematica. Theory and Practice for Science, Mathematics, and Engineering,} Cambridge University Press, Cambridge, 2000.
\par \pard\plain {\listtext\pard\plain \li720\ri0\fi0\fs20\lang1038\qj\f4 \'b7}\ilvl0 \s6\f3\fs20\lang1038\li720\ri0\fi0\f1\qj\ls1 Szili, L., T\'f3th, J.: {\i Mathematics and Mathematica,} ELTE E\'f6tv\'f6s Kiad\'f3, Budapest, 1996. (In Hungarian).
\par \pard\plain \s2\fs20\lang1038\qj 
\par \pard\plain \s6\f3\fs20\lang1038 
\par }